Abstract
The interplay of minimum degree conditions and structural properties of large graphs with forbidden subgraphs is a central topic in extremal graph theory. For a given graph F we define the homomorphism threshold as the infimum over all α ∈ [0,1] such that every n-vertex F-free graph G with minimum degree at least αn has a homomorphic image H of bounded order (i.e. independent of n), which is F-free as well. Without the restriction of H being F-free we recover the definition of the chromatic threshold, which was determined for every graph F by Allen et al. [1]. The homomorphism threshold is less understood and we address the problem for odd cycles.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Allen, J. Böttcher, S. Griffiths, Y. Kohayakawa and R. Morris: The chromatic thresholds of graphs, Adv. Math.235 (2013), 261–295.
B. Andrásfai: Über ein Extremalproblem der Graphentheorie, Acta Math. Acad. Sci. Hungar.13 (1962), 443–455 (in German).
B. Andrásfai: Graphentheoretische Extremalprobleme, Acta Math. Acad. Sci. Hungar15 (2), 413–438 (in German).
B. Andrásfai, P. Erdős and V. SóAs: On the connection between chromatic number, maximal clique and minimal degree of a graph, Discrete Math.8 (1974), 205–218.
P. Erdős: Remarks on a theorem of Ramsay, Bull. Res. Council Israel. Sect. F7F (1957/1058), 21–24.
P. Erdos and T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar10 (1959), 337–356.
P. Erdős and M. Simonovits: On a valence problem in extremal graph theory, Discrete Math.5 (1973), 323–334.
W. Goddard and J. Lyle: Dense graphs with small clique number, J. Graph Theory66 (2011), 319–331.
A. Gyárfás, C. Rousseau and R. Schelp: An extremal problem for paths in bipartite graphs, J. Graph Theory8 (1984), 83–95.
R. Häggkvist, Odd cycles of specified length in nonbipartite graphs, Graph theory (Cambridge, 1981), North-Holland Math. Stud., vol. 62, North-Holland, Amsterdam-New York, 1982, 89–99.
S. Janson, T. Luczak and A. Ruciński: Random graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
S. Letzter and R. Snyder: The homomorphism threshold of {C3, C5}-free graphs, J. Graph Theory90 (2019), 83–106.
T. Luczak: On the structure of triangle-free graphs of large minimum degree, Combinatorica26 (2006), 489–493.
T. Luczak and S. Thomassé: Coloring dense graphs via VC-dimension, Coloring dense graphs via VC-dimension, available at arXiv:1007.1670.
J. Lyle, On the chromatic number of H-free graphs of large minimum degree, Graphs Combin.27 (2011), 741–754.
V. Nikiforov, Chromatic number and minimum degree of Kr-free graphs, available at arXiv:1001.2070.
H. Oberkampf and M. Schacht: On the structure of dense graphs with fixed clique number, Combin. Probab. Comput., available at arXiv:1602.02302. To appear.
C. Thomassen, On the chromatic number of triangle-free graphs of large minimum degree, Combinatorica22 (2002), 591–596.
C. Thomassen, On the chromatic number of pentagon-free graphs of large minimum degree, Combinatorica27 (2007), 241–243.
K. Zarankiewicz, Sur les relations synétriques dans l’ensemble fini, Colloquium Math.1 (1947), 10–14 (in French).
Acknowledgments
We thank both referees for their detailed and helpful remarks.
Author information
Authors and Affiliations
Corresponding authors
Additional information
The second author is supported by ERC Consolidator Grant 724903.
Rights and permissions
About this article
Cite this article
Ebsen, O., Schacht, M. Homomorphism Thresholds for Odd Cycles. Combinatorica 40, 39–62 (2020). https://doi.org/10.1007/s00493-019-3920-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-019-3920-8