The cube graph Q n is the skeleton of the n-dimensional cube. It is an n-regular graph on 2n vertices. The Ramsey number r(Q n ;K s ) is the minimum N such that every graph of order N contains the cube graph Q n or an independent set of order s. In 1983, Burr and Erdős asked whether the simple lower bound r(Q n ;K s )≥(s−1)(2n−1)+1 is tight for s fixed and n sufficiently large. We make progress on this problem, obtaining the first upper bound which is within a constant factor of the lower bound.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
Tax calculation will be finalised during checkout.
P. Allen, G. Brightwell and J. Skokan: Ramsey-goodness — and otherwise, Combinatorica 33 (2013), 125–160.
N. Alon, P. Seymour and R. Thomas: A separator theorem for nonplanar graphs, J. Amer. Math. Soc. 3 (1990), 801–808.
J. Beck: An upper bound for diagonal Ramsey numbers, Studia Sci. Math. Hungar. 18 (1983), 401–406.
J. Böttcher, K. Pruessman, A. Taraz and A. ürfl: Bandwidth, expansion, treewidth, separators, and universality for bounded degree graphs, European J. Combin. 31 (2010), 1217–1227.
J. Böttcher, M. Schacht and A. Taraz: Proof of the bandwidth conjecture of Bollobás and Komlós, Math. Ann. 343 (2009), 175–205.
S. Brandt: Expanding graphs and Ramsey numbers, available at Freie Universität, Berlin preprint server, ftp://ftp.math.fuerlin.de/pub/math/publ/pre/1996/pr-a-96-24.ps (1996).
W. G. Brown: On graphs that do not contain a Thomsen graph, Canad. Math. Bull. 9 (1966), 281–285.
S. A. Burr: Ramsey numbers involving graphs with long suspended paths, J. London Math. Soc. (2) 24 (1981), 405–413.
S. A. Burr: What can we hope to accomplish in generalized Ramsey theory?, Discrete Math. 67 (1987), 215–225.
S. A. Burr and P. Erdős: On the magnitude of generalized Ramsey numbers for graphs, in: Infinite and Finite Sets I (Keszthely, 1973), Colloq. Math. Soc. Janos Bolyai, Vol. 10, 214–240, North-Holland, Amsterdam, 1975.
S. A. Burr and P. Erdős: Generalizations of a Ramsey-theoretic result of Chvátal, J. Graph Theory 7 (1983), 39–51.
S. A. Burr, P. Erdős, R. J. Faudree, C. C. Rousseau and R. H. Schelp: The Ramsey number for the pair complete bipartite graph-graph of limited degree, in: Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984), 163–174, Wiley, New York, 1985.
S. A. Burr, P. Erdős, R. J. Faudree, C. C. Rousseau and R. H. Schelp: Some complete bipartite graph-tree Ramsey numbers, Ann. Discrete Math. 41 (1989), 79–90.
F. Chung and R. L. Graham: Erdős on Graphs. His Legacy of Unsolved Problems, A K Peters, Ltd., Wellesley, MA, 1998.
V. Chvátal: Tree-complete graph Ramsey numbers, J. Graph Theory 1 (1977), 93.
V. Chvátal and F. Harary: Generalized Ramsey theory for graphs, III. Small off-diagonal numbers, Pacific J. Math. 41 (1972), 335–345.
G. Fiz Pontiveros, S. Griffiths, R. Morris, D. Saxton and J. Skokan: On the Ramsey number of the triangle and the cube, Combinatorica, accepted.
G. Fiz Pontiveros, S. Griffiths, R. Morris, D. Saxton and J. Skokan: The Ramsey number of the clique and the hypercube, J. London Math. Soc. 89, 2014, 680–702.
J. Fox and J. Pach: A separator theorem for string graphs and its applications, Combin. Probab. Comput. 19 (2010), 371–390.
J. Fox and B. Sudakov: Density theorems for bipartite graphs and related Ramseytype results, Combinatorica 29 (2009), 153–196.
J. Fox and B. Sudakov: Dependent random choice, Random Structures Algorithms 38 (2011), 68–99.
R. L. Graham, V. Rödl and A. Ruciński: On graphs with linear Ramsey numbers, J. Graph Theory 35 (2000), 176–192.
R. L. Graham, V. Rödl and A. Ruciński: On bipartite graphs with linear Ramsey numbers, Combinatorica 21 (2001), 199–209.
A. Kostochka: The minimum Hadwiger number for graphs with a given mean degree of vertices, Metody Diskret. Analiz. 38 (1982), 37–58.
A. Kostochka: Lower bound of the Hadwiger number of graphs by their average degree, Combinatorica 4 (1984), 307–316.
A. Kostochka and V. Rödl: On graphs with small Ramsey numbers, J. Graph Theory 37 (2001), 198–204.
R. J. Lipton and R. E. Tarjan: A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979), 177–189.
W. Mader: Homomorphiesätze für Graphen, Math. Ann. 178 (1968), 154–168.
G. L. Miller, S.-H. Teng, W. Thurston and S. A. Vavasis: Separators for sphere-packings and nearest neighbor graphs, J. ACM 44 (1997), 1–29.
V. Nikiforov and C. C. Rousseau: Ramsey goodness and beyond, Combinatorica 29 (2009), 227–262.
N. Robertson and P. D. Seymour: Graph minors. XX. Wagner’s conjecture, J. Combin. Theory Ser. B 92 (2004), 325–357.
L. Shi: Cube Ramsey numbers are polynomial, Random Structures Algorithms 19 (2001), 99–101.
L. Shi: The tail is cut for Ramsey numbers of cubes, Discrete Math. 307 (2007), 290–292.
R. Stanley: Enumerative Combinatorics, Volume 1, Cambridge Studies in Advanced Mathematics 49, Cambridge University Press, Cambridge, UK, 2002.
A. Thomason: An extremal function for contractions of graphs, Math. Proc. Cam. Phil. Soc. 95 (1984), 261–265.
A. Thomason: The extremal function for complete minors, J. Combin. Theory Ser. B 81 (2001), 318–338.
Research supported by a Royal Society University Research Fellowship.
Research supported by a Packard Fellowship, a Simons Fellowship, an MIT NEC Corp. award and NSF grant DMS-1069197.
Research supported in part by a Samsung Scholarship.
Research supported in part by SNSF grant 200021-149111 and by a USA-Israel BSF grant.
About this article
Cite this article
Conlon, D., Fox, J., Lee, C. et al. Ramsey numbers of cubes versus cliques. Combinatorica 36, 37–70 (2016). https://doi.org/10.1007/s00493-014-3010-x
Mathematics Subject Classification (2000)