Robuta

https://www.scirp.org/journal/papercitationdetails?paperid=38531&JournalID=535
The planar Ramsey number PR (H1, H2) is the smallest integer n such that any planar graph on n vertices contains a copy of H1 or its complement contains a copy...
ramsey numbersplanarprksub
https://www.arxiv.org/abs/2601.13944
Abstract page for arXiv paper 2601.13944: Gallai-Ramsey Numbers for $\ell$-Connected Graphs
ramsey numbersgallaiellconnectedgraphs