On Komlós’ tiling theorem in random graphs

DOI10.1017/S0963548319000129zbMath1436.05098arXiv1611.09466OpenAlexW2963911911MaRDI QIDQ5222573

Nemanja Škorić, Rajko Nenadov

Publication date: 6 April 2020

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.09466

zbMATH Keywords

perfect \(H\)-packingtriangle packings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items (3)

Dirac-type theorems in random hypergraphs ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ Covering cycles in sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Local resilience of spanning subgraphs in sparse random graphs
• On the KŁR conjecture in random graphs
• Hypergraph containers
• Almost \(H\)-factors in dense graphs
• On \(K^ 4\)-free subgraphs of random graphs
• Tiling Turán theorems
• \(H\)-factors in dense graphs
• The minimum degree threshold for perfect graph packings
• Corrádi and Hajnal's Theorem for Sparse Random Graphs
• Factors in random graphs
• Embedding large subgraphs into dense graphs
• Szemerédi’s Regularity Lemma for Sparse Graphs
• Proof of a tiling conjecture of Komlós
• Nonvertex‐Balanced Factors in Random Graphs
• Independent sets in hypergraphs
• On the maximal number of independent circuits in a graph
• Concentration of multivariate polynomials and its applications
• Proof of the Alon-Yuster conjecture

This page was built for publication: On Komlós’ tiling theorem in random graphs