Graphs with asymmetric Ramsey properties
Walner Mendon\c{c}a, Meysam Miralaei, Guilherme O. Mota

TL;DR
This paper constructs graphs demonstrating asymmetric Ramsey properties, showing that for each k, there exists a graph that avoids certain monochromatic cliques yet guarantees others, extending classical symmetric results.
Contribution
The authors prove the existence of graphs with asymmetric Ramsey properties using probabilistic methods and hypergraph containers, generalizing classical symmetric theorems.
Findings
Existence of graphs avoiding certain monochromatic cliques while guaranteeing others.
Extension of classical symmetric Ramsey theorems to asymmetric cases.
Application of probabilistic and hypergraph container techniques.
Abstract
Given positive integers and we write if every 2-colouring of the edges of yields a red copy of or a blue copy of and we denote by the minimum such that . By using probabilistic methods and hypergraph containers we prove that for every integer , there exists a graph such that and . This result can be viewed as a variation of a classical theorem of Ne\v{s}et\v{r}il and R\"odl [The Ramsey property for graphs with forbidden complete subgraphs, Journal of Combinatorial Theory, Series B, 20 (1976), 243-249], who proved that for every integer there exists a graph with no copies of such that .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Graph Theory Research · Advanced Topology and Set Theory
