@inproceedings{23654da4f0894bf0898ba9876e4aedcf,

title = "Linear Ramsey numbers",

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 number is 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 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.",

author = "Aistis Atminas and Vadim Lozin and Viktor Zamaraev",

note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG, part of Springer Nature 2018.; 29th International Workshop on Combinatorial Algorithms, IWOCA 2018 ; Conference date: 16-07-2018 Through 19-07-2018",

year = "2018",

doi = "10.1007/978-3-319-94667-2_3",

language = "English",

isbn = "9783319946665",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "26--38",

editor = "Leong, {Hon Wai} and Costas Iliopoulos and Wing-Kin Sung",

booktitle = "Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Proceedings",

}