Sparse partition universal graphs for graphs of bounded degree

Yoshiharu Kohayakawa, Vojtěch Rödl, Mathias Schacht, E. Szemerédi

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

In 1983, Chvátal, Trotter and the two senior authors proved that for any Δ there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph KN with N≥Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Δ. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N2-1/Δlog1/ΔN) edges, with N=⌈B'n⌉ for some constant B.⌉ that depends only on Δ. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Δ is O(n2-1/Δlog1/Δn). Our approach is based on random graphs; in fact, we show that the classical Erdõs-Rényi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Δ.The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed.

Original languageEnglish
Pages (from-to)5041-5065
Number of pages25
JournalAdvances in Mathematics
Volume226
Issue number6
DOIs
Publication statusPublished - Apr 1 2011

Fingerprint

Universal Graphs
Vertex Degree
Maximum Degree
Partition
Graph in graph theory
Random Graphs
Complete Graph
Colouring
Regularity
Ramsey number
Sparse Graphs
Linear Order

Keywords

  • Inheritance of regularity
  • Random graphs
  • Regularity lemma
  • Size-Ramsey numbers
  • Universal graphs

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Sparse partition universal graphs for graphs of bounded degree. / Kohayakawa, Yoshiharu; Rödl, Vojtěch; Schacht, Mathias; Szemerédi, E.

In: Advances in Mathematics, Vol. 226, No. 6, 01.04.2011, p. 5041-5065.

Research output: Contribution to journalArticle

Kohayakawa, Yoshiharu ; Rödl, Vojtěch ; Schacht, Mathias ; Szemerédi, E. / Sparse partition universal graphs for graphs of bounded degree. In: Advances in Mathematics. 2011 ; Vol. 226, No. 6. pp. 5041-5065.
@article{74c2553f8e05416aae07847862eaf574,
title = "Sparse partition universal graphs for graphs of bounded degree",
abstract = "In 1983, Chv{\'a}tal, Trotter and the two senior authors proved that for any Δ there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph KN with N≥Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Δ. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N2-1/Δlog1/ΔN) edges, with N=⌈B'n⌉ for some constant B.⌉ that depends only on Δ. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Δ is O(n2-1/Δlog1/Δn). Our approach is based on random graphs; in fact, we show that the classical Erd{\~o}s-R{\'e}nyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Δ.The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed.",
keywords = "Inheritance of regularity, Random graphs, Regularity lemma, Size-Ramsey numbers, Universal graphs",
author = "Yoshiharu Kohayakawa and Vojtěch R{\"o}dl and Mathias Schacht and E. Szemer{\'e}di",
year = "2011",
month = "4",
day = "1",
doi = "10.1016/j.aim.2011.01.004",
language = "English",
volume = "226",
pages = "5041--5065",
journal = "Advances in Mathematics",
issn = "0001-8708",
publisher = "Academic Press Inc.",
number = "6",

}

TY - JOUR

T1 - Sparse partition universal graphs for graphs of bounded degree

AU - Kohayakawa, Yoshiharu

AU - Rödl, Vojtěch

AU - Schacht, Mathias

AU - Szemerédi, E.

PY - 2011/4/1

Y1 - 2011/4/1

N2 - In 1983, Chvátal, Trotter and the two senior authors proved that for any Δ there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph KN with N≥Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Δ. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N2-1/Δlog1/ΔN) edges, with N=⌈B'n⌉ for some constant B.⌉ that depends only on Δ. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Δ is O(n2-1/Δlog1/Δn). Our approach is based on random graphs; in fact, we show that the classical Erdõs-Rényi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Δ.The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed.

AB - In 1983, Chvátal, Trotter and the two senior authors proved that for any Δ there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph KN with N≥Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Δ. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N2-1/Δlog1/ΔN) edges, with N=⌈B'n⌉ for some constant B.⌉ that depends only on Δ. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Δ is O(n2-1/Δlog1/Δn). Our approach is based on random graphs; in fact, we show that the classical Erdõs-Rényi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Δ.The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed.

KW - Inheritance of regularity

KW - Random graphs

KW - Regularity lemma

KW - Size-Ramsey numbers

KW - Universal graphs

UR - http://www.scopus.com/inward/record.url?scp=79953839272&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79953839272&partnerID=8YFLogxK

U2 - 10.1016/j.aim.2011.01.004

DO - 10.1016/j.aim.2011.01.004

M3 - Article

AN - SCOPUS:79953839272

VL - 226

SP - 5041

EP - 5065

JO - Advances in Mathematics

JF - Advances in Mathematics

SN - 0001-8708

IS - 6

ER -