Skip to main content Accessibility help
×
Home

On minimal Ramsey graphs and Ramsey equivalence in multiple colours

  • Dennis Clemens (a1), Anita Liebenau (a2) and Damian Reding

Abstract

For an integer q ⩾ 2, a graph G is called q-Ramsey for a graph H if every q-colouring of the edges of G contains a monochromatic copy of H. If G is q-Ramsey for H yet no proper subgraph of G has this property, then G is called q-Ramsey-minimal for H. Generalizing a statement by Burr, Nešetřil and Rödl from 1977, we prove that, for q ⩾ 3, if G is a graph that is not q-Ramsey for some graph H, then G is contained as an induced subgraph in an infinite number of q-Ramsey-minimal graphs for H as long as H is 3-connected or isomorphic to the triangle. For such H, the following are some consequences.

  • For 2 ⩽ r < q, every r-Ramsey-minimal graph for H is contained as an induced subgraph in an infinite number of q-Ramsey-minimal graphs for H.

  • For every q ⩾ 3, there are q-Ramsey-minimal graphs for H of arbitrarily large maximum degree, genus and chromatic number.

  • The collection $\{\mathcal M_q(H) \colon H \text{ is 3-connected or } K_3\}$ forms an antichain with respect to the subset relation, where $\mathcal M_q(H)$ denotes the set of all graphs that are q-Ramsey-minimal for H.

We also address the question of which pairs of graphs satisfy $\mathcal M_q(H_1)=\mathcal M_q(H_2)$ , in which case H1 and H2 are called q-equivalent. We show that two graphs H1 and H2 are q-equivalent for even q if they are 2-equivalent, and that in general q-equivalence for some q ⩾ 3 does not necessarily imply 2-equivalence. Finally we indicate that for connected graphs this implication may hold: results by Nešetřil and Rödl and by Fox, Grinshpun, Liebenau, Person and Szabó imply that the complete graph is not 2-equivalent to any other connected graph. We prove that this is the case for an arbitrary number of colours.

Copyright

Corresponding author

*Corresponding author. Email: a.liebenau@unsw.edu.au

Footnotes

Hide All

Supported by an ARC Decra Fellowship. Previously at Monash University where this research was partly carried out.

Footnotes

References

Hide All
[1]Axenovich, M., Rollin, J. and Ueckerdt, T. (2017) Conditions on Ramsey nonequivalence. J. Graph Theory 86 159192.
[2]Balister, P., Lehel, J. and Schelp, R. (2006) Ramsey unsaturated and saturated graphs. J. Graph Theory 51 2232.
[3]Bloom, T. and Liebenau, A. (2018) Ramsey equivalence of Kn and Kn + Kn-1. Electron. J. Combin. 25 P3.4.
[4]Bodkin, C. (2016) Folkman numbers and a conjecture in Ramsey theory. Master’s thesis, FU Berlin.
[5]Bollobás, B., Donadelli, J., Kohayakawa, Y. and Schelp, R. (2001) Ramsey minimal graphs. J. Brazil. Comput. Soc. 7 2737.10.1590/S0104-65002001000200005
[6]Burr, S., Erdős, P., Faudree, R., Rousseau, C. and Schelp, R. (1981) Ramsey-minimal graphs for star-forests. Discrete Math. 33 227237.
[7]Burr, S., Erdős, P. and Lovász, L. (1976) On graphs of Ramsey type. Ars Combin. 1 167190.
[8]Burr, S., Faudree, R. and Schelp, R. (1977) On Ramsey-minimal graphs. In Proc. 8th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 115124.
[9]Burr, S., Nešetřil, J. and Rödl, V. (1985) On the use of senders in generalized Ramsey theory for graphs. Discrete Math. 54 113.10.1016/0012-365X(85)90057-3
[10]Conlon, D. (2009) A new upper bound for diagonal Ramsey numbers. Ann. of Math. 170 941960.
[11]Erdős, P. (1947) Some remarks on the theory of graphs. Bull. Amer. Math. Soc. 53 292294.
[12]Erdős, P. and Szekeres, G. (1935) A combinatorial problem in geometry. Compositio Math. 2 463470.
[13]Faudree, R. (2018) Ramsey minimal graphs for forests. Ars Combin 31 117124.
[14]Folkman, J. (1970) Graphs with monochromatic complete subgraphs in every edge coloring. SIAM J. Appl. Math. 18 1924.10.1137/0118004
[15]Fox, J., Grinshpun, A., Liebenau, A., Person, Y. and Szabó, T. (2014) What is Ramsey-equivalent to a clique? J. Combin. Theory Ser. B 109 120133.10.1016/j.jctb.2014.06.003
[16]Fox, J., Grinshpun, A., Liebenau, A., Person, Y. and Szabó, T. (2016) On the minimum degree of minimal Ramsey graphs for multiple colours. J. Combin. Theory Ser. B 120 6482.
[17]Fox, J. and Lin, K. (2006) The minimum degree of Ramsey-minimal graphs. J. Graph Theory 54 167177.
[18]Graham, R. and Rödl, V. (1987) Numbers in Ramsey theory. Surveys Combin. 123 111153.
[19]Guo, H. and Warnke, L. (2020) Packing nearly optimal Ramsey R(3, t) graphs. https://doi.org/10.1007/s00493-019-3921-7
[20]Hàn, H., Rödl, V. and Szabó, T. (2018) Vertex Folkman numbers and the minimum degree of minimal Ramsey graphs. SIAM J. Discrete Math. 32 826838.10.1137/17M1116696
[21]Lin, S. (1972) On Ramsey numbers and K r-coloring of graphs. J. Combin. Theory Ser. B 12 8292.
[22]Łuczak, T. (1994) On Ramsey minimal graphs. Electron. J. Combin 1 R4.
[23]Nešetřil, J. and Rödl, V. (1976) The Ramsey property for graphs with forbidden complete subgraphs. J. Combin. Theory Ser. B 20 243249.
[24]Ramsey, F. (1930) On a problem of formal logic. Proc. London Math. Soc. 30 264286.
[25]Rödl, V. and Ruciński, A. (1995) Threshold functions for Ramsey properties. J. Amer. Math. Soc. 8 917942.
[26]Rödl, V. and Siggers, M. (2008) On Ramsey minimal graphs. SIAM J. Discrete Math. 22 467488.
[27]Spencer, J. (1977) Asymptotic lower bounds for Ramsey functions. Discrete Math. 20 6976.10.1016/0012-365X(77)90044-9
[28]Szabó, T., Zumstein, P. and Zürcher, S. (2010) On the minimum degree of minimal Ramsey graphs. J. Graph Theory 64 150164.
[29]Thomason, A. (1988) An upper bound for some Ramsey numbers. J. Graph Theory 12 509517.10.1002/jgt.3190120406

MSC classification

On minimal Ramsey graphs and Ramsey equivalence in multiple colours

  • Dennis Clemens (a1), Anita Liebenau (a2) and Damian Reding

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.