Linear Ramsey Numbers

  • Aistis Atminas
  • Vadim LozinEmail author
  • Viktor Zamaraev
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10979)


The Ramsey number \(R_X(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 number is linear in X if there is a constant k such that \(R_{X}(p,q) \le k(p+q)\) for all pq. In the present paper we conjecture that Ramsey number is linear in X if and only if the co-chromatic number is bounded in X and determine Ramsey numbers for several classes of graphs that verify the conjecture.



Vadim Lozin acknowledges support from the Russian Science Foundation Grant No. 17-11-01336.


  1. 1.
    Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (2004)zbMATHGoogle Scholar
  2. 2.
    Belmonte, R., Heggernes, P., van’t Hof, P., Rafiey, A., Saei, R.: Graph classes and Ramsey numbers. Discrete Appl. Math. 173, 16–27 (2014)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Blázsik, Z., Hujter, M., Pluhár, A., Tuza, Z.: Graphs with no induced \(C_4\) and \(2K_2\). Discrete Math. 115, 51–55 (1993)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Chudnovsky, M., Seymour, P.: Extending Gyárfás-Sumner conjecture. J. Comb. Theory Ser. B 105, 11–16 (2014)CrossRefGoogle Scholar
  5. 5.
    Corneil, D.G., Lerchs, H., Stewart, B.L.: Complement reducible graphs. Discrete Appl. Math. 3, 163–174 (1981)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Foldes, S., Hammer, P.L.: Split graphs. In: Congressus Numerantium, no. XIX, pp. 311–315 (1977)Google Scholar
  7. 7.
    Olariu, S.: Paw-free graphs. Inf. Process. Lett. 28, 53–54 (1988)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Ramsey, F.P.: On a problem of formal logic. Proc. Lond. Math. Soc. 30, 264–286 (1930)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Steinberg, R., Tovey, C.A.: Planar Ramsey numbers. J. Combin. Theory Ser. B 59, 288–296 (1993)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of MathematicsLondon School of EconomicsLondonUK
  2. 2.University of WarwickCoventryUK
  3. 3.Lobachevsky State University of Nizhniy NovgorodNizhny NovgorodRussia
  4. 4.Department of Computer ScienceDurham UniversityDurhamUK

Personalised recommendations