Location of Repository

Dense H-free graphs are almost (Χ(H)-1)-partite

By Peter Allen

Abstract

By using the Szemeredi Regularity Lemma, Alon and Sudakov recently\ud extended the classical Andrasfai-Erdos-Sos theorem to cover general graphs. We\ud prove, without using the Regularity Lemma, that the following stronger statement\ud is true.\ud Given any (r+1)-partite graph H whose smallest part has t vertices, there exists\ud a constant C such that for any given ε>0 and sufficiently large n the following is\ud true. Whenever G is an n-vertex graph with minimum degree\ud δ(G)≥(1 −\ud 3/3r−1 + ε)n,\ud either G contains H, or we can delete f(n,H)≤Cn2−1/t edges from G to obtain an\ud r-partite graph. Further, we are able to determine the correct order of magnitude\ud of f(n,H) in terms of the Zarankiewicz extremal function

Topics: QA
Publisher: Electronic Journal of Combinatorics
Year: 2010
OAI identifier: oai:wrap.warwick.ac.uk:3285

Suggested articles

Preview

Citations

  1. (1941). Eine Extremalaufgabe aus der Graphentheorie,
  2. (2006). H-free graphs of large minimum degree,
  3. (1996). Norm-graphs and bipartite Tur´ an numbers, doi
  4. (1954). On a problem of K.
  5. (1973). On a valence problem in extremal graph theory, doi
  6. (1966). On graphs that do not contain a Thomsen graph, doi
  7. (1974). On the connection between chromatic number, maximal clique and minimal degree of a graph,
  8. (1964). os, On extremal problems of graphs and generalized graphs, doi
  9. (1976). Regular partitions of graphs, Probl` emes combinatoires et th´ eorie des graphes
  10. (1947). Sur les relations sym´ etriques dans l’ensemble fini,
  11. (1958). Uber ein problem von K. doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.