On a tiling conjecture of Komlós for 3-chromatic graphs.

DOI10.1016/S0012-365X(03)00157-2zbMath1037.05027OpenAlexW2171877312WikidataQ122902767 ScholiaQ122902767MaRDI QIDQ1426117

Yi Zhao, Ali Shokoufandeh

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00157-2

zbMATH Keywords

regularity lemmacritical chromatic numberextremal graph theoryblow-up lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Bandwidth theorem for random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On circuits in graphs
• Almost \(H\)-factors in dense graphs
• Blow-up lemma
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• An algorithmic version of the blow-up lemma
• On the maximal number of independent circuits in a graph
• Some Theorems on Abstract Graphs
• Proof of the Alon-Yuster conjecture

This page was built for publication: On a tiling conjecture of Komlós for 3-chromatic graphs.