Hostname: page-component-8448b6f56d-dnltx Total loading time: 0 Render date: 2024-04-23T12:01:07.733Z Has data issue: false hasContentIssue false
  • English
  • Français

Making Kr+1-free graphs r-partite

Part of: Graph theory

Published online by Cambridge University Press:  10 November 2020

József Balogh ,
Felix Christian Clemen ,
Mikhail Lavrov ,
Bernard Lidický  and
Florian Pfender
József Balogh
Affiliation:
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL61801, USA, and Moscow Institute of Physics and Technology, Russian Federation
Felix Christian Clemen
Affiliation:
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL61801, USA
Mikhail Lavrov
Affiliation:
Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL61801, USA
Bernard Lidický*
Affiliation:
Department of Mathematics, Iowa State University, Ames, IA50011, USA
Florian Pfender
Affiliation:
Department of Mathematical and Statistical Sciences, University of Colorado Denver, CO 80217-3364, USA
*
*Corresponding author. Email: lidicky@iastate.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The Erdős–Simonovits stability theorem states that for all ε > 0 there exists α > 0 such that if G is a Kr+1-free graph on n vertices with e(G) > ex(n, Kr+1)– α n2, then one can remove εn2 edges from G to obtain an r-partite graph. Füredi gave a short proof that one can choose α = ε. We give a bound for the relationship of α and ε which is asymptotically sharp as ε → 0.

MSC classification

Primary: 05C35: Extremal problems
Type
Paper
Information
Combinatorics, Probability and Computing , Volume 30 , Issue 4 , July 2021 , pp. 609 - 618
Check for updates
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2020. Published by Cambridge University Press

Footnotes

†

Research is partially supported by NSF grant DMS-1764123, Arnold O. Beckman Research Award (UIUC Campus Research Board RB 18132) and the Langan Scholar Fund (UIUC).

‡

Research of this author is partially supported by NSF grant DMS-1855653.

§

Research of this author is partially supported by NSF grant DMS-1855622.

References

Amin, K., Faudree, J., Gould, R. J. and Sidorowicz, E. (2013) On the non-(p −1)-partite Kp-free graphs. Discuss. Math.Graph Theory 33 9–23.CrossRefGoogle Scholar
Andrásfai, B., Erdős, P. and Sós, V. T. (1974) On the connection between chromatic number, maximal clique and minimal degree of a graph. Discrete Math. 8 205–218.CrossRefGoogle Scholar
Balogh, J.,Morris, R., Samotij, W. and Warnke, L. (2016) The typical structure of sparse Kr+1-free graphs. Trans. Amer.Math. Soc. 368 6439–6485.Google Scholar
Brouwer, A. E. (1981) Some Lotto Numbers From an Extension of Turán’s Theorem, Vol. 152 of Afdeling Zuivere Wiskunde [Department of Pure Mathematics]. Mathematisch Centrum, Amsterdam.Google Scholar
Erdős, P. (1970) On the graph theorem of Turán. Mat. Lapok 21 249–251.Google Scholar
Erdős, P., Faudree, R., Pach, J. and Spencer, J. (1988) How to make a graph bipartite. J. Combin. Theory Ser. B 45 86–98.CrossRefGoogle Scholar
Erdős, P., Gyrői, E. and Simonovits, M. (1992) How many edges should be deleted to make a triangle-free graph bipartite? In Sets, Graphs and Numbers (Budapest, 1991), Vol. 60 of Colloquia Mathematica Societatis János Bolyai, pp. 239–263. North-Holland.Google Scholar
Erdős, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hungar 1 51–57.Google Scholar
Füredi, Z. (2015) A proof of the stability of extremal graphs, Simonovits’ stability from Szemerédi’s regularity. J. Combin.Theory Ser. B 115 66–71.CrossRefGoogle Scholar
Hanson, D. and Toft, B. (1991) k-saturated graphs of chromatic number at least k . Ars Combin. 31 159–164.Google Scholar
Hu, P., Lidický, B., Martins, T., Norin, S. and Volec, J. Large multipartite subgraphs in H-free graphs. Manuscript.Google Scholar
Kang, M. and Pikhurko, O. (2005) Maximum K r+1-free graphs which are not r-partite. Mat. Stud. 24 12–20.Google Scholar
Korándi, D., Roberts, A. and Scott, A. (2020) Exact stability for Turán’s theorem. arXiv:2004.10685Google Scholar
Nikiforov, V. (2011) Some new results in extremal graph theory. In Surveys in Combinatorics 2011, Vol. 392 of London Mathematical Society Lecture Note Series, pp. 141–181. Cambridge University Press.Google Scholar
Roberts, A. and Scott, A. (2018) Stability results for graphs with a critical edge. arXiv:1610.08389. https://doi.org/10.1016/j.ejc.2018.07.004 CrossRefGoogle Scholar
Sudakov, B. (2007) Making a K 4-free graph bipartite. Combinatorica 27 509–518.CrossRefGoogle Scholar
Turán, P. (1941) Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48 436–452.Google Scholar
Tyomkyn, M. and Uzzell, A. J. (2015) Strong Turán stability. Electron. J. Combin. 22 P3–9.CrossRefGoogle Scholar