Skip to main content Accessibility help
×
Home
Hostname: page-component-56f9d74cfd-89lq7 Total loading time: 0.278 Render date: 2022-06-28T03:56:28.211Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs*

Published online by Cambridge University Press:  20 January 2016

DENNIS CLEMENS
Affiliation:
Technische Universität Hamburg–Harburg, Institut für Mathematik, Am Schwarzenberg-Campus 3, 21073 Hamburg, Germany (e-mail: dennis.clemens@tuhh.de)
YURY PERSON
Affiliation:
Goethe-Universität, Institut für Mathematik, Robert-Mayer-Straß e 10, 60325 Frankfurt am Main, Germany (e-mail: person@math.uni-frankfurt.de)

Abstract

A uniform hypergraph H is called k-Ramsey for a hypergraph F if, no matter how one colours the edges of H with k colours, there is always a monochromatic copy of F. We say that H is k-Ramsey-minimal for F if H is k-Ramsey for F but every proper subhypergraph of H is not. Burr, Erdős and Lovasz studied various parameters of Ramsey-minimal graphs. In this paper we initiate the study of minimum degrees and codegrees of Ramsey-minimal 3-uniform hypergraphs. We show that the smallest minimum vertex degree over all k-Ramsey-minimal 3-uniform hypergraphs for Kt(3) is exponential in some polynomial in k and t. We also study the smallest possible minimum codegree over 2-Ramsey-minimal 3-uniform hypergraphs.

MSC classification

Type
Paper
Copyright
Copyright © Cambridge University Press 2016 

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.)

Footnotes

*

After this paper was accepted and processed, we managed to obtain BEL-gadgets for uniformities r ⩾ 4. This work will appear elsewhere.

An extended abstract of this paper appears in the proceedings of EuroComb 2015 [3].

References

[1] Burr, S. A., Erdős, P. and Lovász, L. (1976) On graphs of Ramsey type. Ars Combin. 1 167190.Google Scholar
[2] Burr, S. A., Nešetřil, J. and Rödl, V. (1985) On the use of senders in generalized Ramsey theory for graphs. Discrete Math. 54 113.CrossRefGoogle Scholar
[3] Clemens, D. and Person, Y. (2015) Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. In Eighth European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2015), Electron. Notes in Discrete Math., Elsevier, pp. 2330.Google Scholar
[4] Conlon, D. (2009) A new upper bound for diagonal Ramsey numbers. Ann. of Math. (2) 170 941960.CrossRefGoogle Scholar
[5] Conlon, D., Fox, J. and Sudakov, B. (2015) Recent developments in graph Ramsey theory. In Surveys in Combinatorics 2015, Cambridge University Press, pp. 49118.CrossRefGoogle Scholar
[6] Dudek, A., La Fleur, S., Mubayi, D. and Rödl, V. On the size-Ramsey number of hypergraphs. Submitted.Google Scholar
[7] Erdős, P., Faudree, R. J., Rousseau, C. C. and Schelp, R. H. (1978) The size Ramsey number. Period. Math. Hungar. 9 145161.CrossRefGoogle Scholar
[8] Erdős, P. and Hajnal, A. (1966) On chromatic number of graphs and set-systems. Acta Math. Acad. Sci. Hungar. 17 6199.CrossRefGoogle Scholar
[9] 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.CrossRefGoogle Scholar
[10] Fox, J., Grinshpun, A., Liebenau, A., Person, Y. and Szabó, T. On the minimum degree of minimal Ramsey graphs for multiple colours. J. Combin. Theory Ser. B, accepted.Google Scholar
[11] Fox, J. and Lin, K. (2006) The minimum degree of Ramsey-minimal graphs. J. Graph Theory 54 167177.CrossRefGoogle Scholar
[12] Graham, R. L., Rothschild, B. L. and Spencer, J. H. (1990) Ramsey Theory, second edition, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley.Google Scholar
[13] Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley.CrossRefGoogle Scholar
[14] Ramsey, F. P. (1930) On a problem in formal logic. Proc. Lond. Math. Soc. 30 264286.CrossRefGoogle Scholar
[15] Rödl, V. and Siggers, M. (2008) On Ramsey minimal graphs. SIAM J. Discrete Math. 22 467488.CrossRefGoogle Scholar
[16] Spencer, J. (1975) Ramsey's theorem: A new lower bound. J. Combin. Theory Ser. A 18 108115.CrossRefGoogle Scholar
[17] Szabó, T., Zumstein, P. and Zürcher, S. (2010) On the minimum degree of minimal Ramsey graphs. J. Graph Theory 64 150164.Google Scholar

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.

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs*
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.

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs*
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.

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs*
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? *