Graph classes with linear Ramsey numbers
Bogdan Alecu, Aistis Atminas, Vadim Lozin, Viktor Zamaraev

TL;DR
This paper investigates conditions under which graph classes have linear Ramsey numbers, proving a key part of a conjecture relating linearity to forbidden subgraphs and exploring bipartite cases.
Contribution
It proves the 'only if' part of a conjecture linking linear Ramsey numbers to forbidden subgraphs and verifies the 'if' part for various classes, advancing understanding of graph Ramsey theory.
Findings
Proved the 'only if' part of the conjecture.
Verified the 'if' part for several graph classes.
Identified similarities and differences in bipartite Ramsey numbers.
Abstract
The Ramsey number for a class of graphs is the minimum such that every graph in with at least vertices has either a clique of size or an independent set of size . We say that Ramsey numbers are linear in if there is a constant such that for all . In the present paper we conjecture that if is a hereditary class defined by finitely many forbidden induced subgraphs, then Ramsey numbers are linear in if and only if excludes a forest, a disjoint union of cliques and their complements. We prove the "only if" part of this conjecture and verify the "if" part for a variety of classes. We also apply the notion of linearity to bipartite Ramsey numbers and reveal a number of similarities and differences between the bipartite and non-bipartite case.
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.
