Skip to main content Accessibility help
×
Home
Hostname: page-component-684899dbb8-x64cq Total loading time: 0.321 Render date: 2022-05-23T03:30:29.432Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

Cycles Are Strongly Ramsey-Unsaturated

Published online by Cambridge University Press:  29 April 2014

J. SKOKAN
Affiliation:
Department of Mathematics, London School of Economics and Political Science, Houghton Street, London WC2A 2AE, UK and Department of Mathematics, University of Illinois at Urbana-Champaign, 1409 W. Green Street, Urbana, IL 61801, USA (e-mail: jozef@member.ams.org)
M. STEIN*
Affiliation:
Centro de Modelamiento Matemático, Universidad de Chile, Santiago, Chile (e-mail: mstein@dim.uchile.cl)
*
Corresponding author.

Abstract

We call a graph H Ramsey-unsaturated if there is an edge in the complement of H such that the Ramsey number r(H) of H does not change upon adding it to H. This notion was introduced by Balister, Lehel and Schelp in [J. Graph Theory51 (2006), pp. 22–32], where it is shown that cycles (except for C4) are Ramsey-unsaturated, and conjectured that, moreover, one may add any chord without changing the Ramsey number of the cycle Cn, unless n is even and adding the chord creates an odd cycle.

We prove this conjecture for large cycles by showing a stronger statement. If a graph H is obtained by adding a linear number of chords to a cycle Cn, then r(H)=r(Cn), as long as the maximum degree of H is bounded, H is either bipartite (for even n) or almost bipartite (for odd n), and n is large.

This motivates us to call cycles strongly Ramsey-unsaturated. Our proof uses the regularity method.

Type
Paper
Copyright
Copyright © Cambridge University Press 2014 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Allen, P., Brightwell, G. and Skokan, J. (2013) Ramsey-goodness; and otherwise. Combinatorica 33 125160.CrossRefGoogle Scholar
[2]Balister, P., Lehel, J. and Schelp, R. H. (2006) Ramsey unsaturated and saturated graphs. J. Graph Theory 51 2232.CrossRefGoogle Scholar
[3]Benevides, F. (2012) A multipartite Ramsey number for odd cycles. J. Graph Theory 71 293316.CrossRefGoogle Scholar
[4]Bondy, J. A. and Erdős, P. (1973) Ramsey numbers for cycles in graphs. J. Combin. Theory Ser. B 14 4654.CrossRefGoogle Scholar
[5]Burr, S. A. and Erdős, P. (1975) On the magnitude of generalized Ramsey numbers for graphs. In Infinite and Finite Sets 1, Vol. 10 of Colloquia Mathematica Societatis János Bolyai, North-Holland, pp. 215240.Google Scholar
[6]Chung, F. R. K. and Graham, R. L. (1975) On multicolor Ramsey numbers for complete bipartite graphs. J. Combin. Theory Ser. B 18 164169.CrossRefGoogle Scholar
[7]Chvatál, V., Rödl, V., Szemerédi, E. and Trotter, W. T. (1983) The Ramsey number of a graph with bounded maximum degree. J. Combin. Theory Ser. B 34 239243.CrossRefGoogle Scholar
[8]Conlon, D., Fox, J. and Sudakov, B. (2012) On two problems in graph Ramsey theory. Combinatorica 32 513535.CrossRefGoogle Scholar
[9]Erdős, P. and Gallai, T. (1959) On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10 337356.CrossRefGoogle Scholar
[10]Faudree, R. J. and Schelp, R. H. (1974) All Ramsey numbers for cycles in graphs. Discrete Math. 8 313329.CrossRefGoogle Scholar
[11]Fox, J. and Sudakov, B. (2011) Dependent random choice. Random Struct. Alg. 38 6899.CrossRefGoogle Scholar
[12]Graham, R., Rödl, V., Ruciński, A. (2000) On graphs with linear Ramsey numbers. J. Graph Theory 35 176192.3.0.CO;2-C>CrossRefGoogle Scholar
[13]Graham, R., Rödl, V., Ruciński, A. (2001) On bipartite graphs with linear Ramsey numbers. Combinatorica 21 199209.CrossRefGoogle Scholar
[14]Kohayakawa, Y., Simonovits, M. and Skokan, J. (2006) Stability of Ramsey numbers for cycles. Manuscript.Google Scholar
[15]Komlós, J. and Simonovits, M. (1996) Szemerédi's regularity lemma and its applications in graph theory. In Combinatorics: Paul Erdős is Eighty, Vol. 2 (Keszthely, 1993), Bolyai Society Mathematical Studies, Springer, pp. 295352.Google Scholar
[16]Rosta, V. (1973) On a Ramsey type problem of J. A. Bondy and P. Erdős I–II. J. Combin. Theory Ser. B 15 94120.CrossRefGoogle Scholar
[17]Szemerédi, E. (1978) Regular partitions of graphs. In Problèmes Combinatoires et Théorie des Graphes (Orsay 1976), Vol. 260 of Colloques Internationaux du CNRS, CNRS, pp. 399401.Google Scholar
1
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Cycles Are Strongly Ramsey-Unsaturated
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Cycles Are Strongly Ramsey-Unsaturated
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Cycles Are Strongly Ramsey-Unsaturated
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *