Hostname: page-component-6766d58669-kn6lq Total loading time: 0 Render date: 2026-05-18T08:14:25.335Z Has data issue: false hasContentIssue false
  • English
  • Français

The Structure of Typical Eye-Free Graphs and a Turán-Type Result for Two Weighted Colours

Published online by Cambridge University Press:  31 July 2017

PETER KEEVASH  and
WILLIAM LOCHET
PETER KEEVASH
Affiliation:
Mathematical Institute, University of Oxford, Woodstock Road, Oxford OX2 6GG, UK (e-mail: keevash@maths.ox.ac.uk)
WILLIAM LOCHET
Affiliation:
Computer Science Department, Ecole Normale Supérieure de Lyon, 46 Allée d'Italie, 69364 Lyon, France (e-mail: william.lochet@ens-lyon.fr)
Get access Rights & Permissions [Opens in a new window]

Abstract

The (a,b)-eye is the graph I a,b = K a+b \ K b obtained by deleting the edges of a clique of size b from a clique of size a+b. We show that for any a,b ≥ 2 and p ∈ (0,1), if we condition the random graph G ~ G(n,p) on having no induced copy of I a,b , then with high probability G is close to an a-partite graph or the complement of a (b−1)-partite graph. Our proof uses the recently developed theory of hypergraph containers, and a stability result for an extremal problem with two weighted colours. We also apply the stability method to obtain an exact Turán-type result for this extremal problem.

Keywords

05C35

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 26 , Issue 6 , November 2017 , pp. 886 - 910
Copyright
Copyright © Cambridge University Press 2017 

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

Article purchase

Temporarily unavailable

References

[1] Alekseev, V. E. (1993) On the entropy values of hereditary classes of graphs. Discrete Math. Appl. 3 191–199.Google Scholar
[2] Alon, N., Balogh, J., Bollobás, B. and Morris, R. (2011) The structure of almost all graphs in a hereditary property. J. Combin. Theory Ser. B 101 85–110.CrossRefGoogle Scholar
[3] Balogh, J., Bollobás, B. and Simonovits, M. (2009) The typical structure of graphs without given excluded subgraphs. Random Struct. Alg. 34 305–318.Google Scholar
[4] Balogh, J., Morris, R. and Samotij, W. (2015) Independent sets in hypergraphs. J. Amer. Math. Soc. 28 669–709.Google Scholar
[5] Balogh, J., Morris, R., Samotij, W. and Warnke, L. (2016) The typical structure of sparse K r+1-free graphs. Trans. Amer. Math. Soc. 368 6439–6485.CrossRefGoogle Scholar
[6] Bollobás, B. and Thomason, A. (1997) Hereditary and monotone properties of graphs. In The Mathematics of Paul Erdős II, Vol. 14 of Algorithms and Combinatorics, Springer, pp. 70–78.Google Scholar
[7] Bollobás, B. and Thomason, A. (2000) The structure of hereditary properties and colourings of random graphs. Combinatorica 20 173–202.Google Scholar
[8] Diwan, A. and Mubayi, D. Turán's theorem with colors. Unpublished manuscript.Google Scholar
[9] Erdős, P., Frankl, P. and Rödl, V. (1986) The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs Combin. 2 113–121.Google Scholar
[10] Erdős, P., Kleitman, D. J. and Rothschild, B. L. (1976) Asymptotic enumeration of K n -free graphs. In Colloquio Internazionale sulle Teorie Combinatorie II (Rome 1973), Vol. 17 of Atti dei Convegni Lincei, Accademia Nazionale dei Lincei, Rome, pp. 19–27.Google Scholar
[11] Erdős, P. and Simonovits, M. (1966) A limit theorem in graph theory. Studia Sci. Math. Hung. Acad. 1 51–57.Google Scholar
[12] Erdős, P. and Stone, A. H. (1946) On the structure of linear graphs. Bull. Amer. Math. Soc. 52 1087–1091.CrossRefGoogle Scholar
[13] Kolaitis, P., Prömel, H. J., and Rothschild, B. (1987) K l+1-free graphs: Asymptotic structure and a 0–1 law. Trans. Amer. Math. Soc. 303 637–671.Google Scholar
[14] Marchant, E. and Thomason, A. (2010) Extremal graphs and multigraphs with two weighted colours. In Fete of Combinatorics and Computer Science, Vol. 20 of Bolyai Society Mathematical Studies, János Bolyai Mathematical Society, pp. 239–286.Google Scholar
[15] Marchant, E. and Thomason, A. (2011) The structure of hereditary properties and 2-coloured multi-graphs. Combinatorica 31 85–93.CrossRefGoogle Scholar
[16] Prömel, H. J. and Steger, A. (1991) Excluding induced subgraphs: Quadrilaterals. Random Struct. Alg. 2 55–71.Google Scholar
[17] Prömel, H. J. and Steger, A. (1992) Excluding induced subgraphs III: General asymptotics. Random Struct. Alg. 3 19–31.Google Scholar
[18] Richer, D. C. (2000) PhD thesis, University of Cambridge.Google Scholar
[19] Saxton, D. and Thomason, A. (2015) Hypergraph containers. Invent. Math. 201 925–992.Google Scholar
[20] Turán, P. (1941) Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok. 48 436–452.Google Scholar