On a tiling conjecture of Komlós for 3-chromatic graphs.
From MaRDI portal
Publication:1426117
DOI10.1016/S0012-365X(03)00157-2zbMath1037.05027WikidataQ122902767 ScholiaQ122902767MaRDI QIDQ1426117
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
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
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