Abstract
The Ramsey number RX(p,q) for a class of graphs X is the minimum n such that every graph in X with at least n vertices has either a clique of size p or an independent set of size q. We say that Ramsey numbers are linear in X if there is a constant k such that RX(p,q)≤k(p+q) for all p,q. In the present paper we conjecture that if X is a hereditary class defined by finitely many forbidden induced subgraphs, then Ramsey numbers are linear in X if and only if X 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
