Article contents
On Komlós’ tiling theorem in random graphs
Published online by Cambridge University Press: 25 July 2019
Abstract
Given graphs G and H, a family of vertex-disjoint copies of H in G is called an H-tiling. Conlon, Gowers, Samotij and Schacht showed that for a given graph H and a constant γ>0, there exists C>0 such that if
$p \ge C{n^{ - 1/{m_2}(H)}}$
, then asymptotically almost surely every spanning subgraph G of the random graph 𝒢(n, p) with minimum degree at least
- Type
- Paper
- Information
- Copyright
- © Cambridge University Press 2019
References
- 3
- Cited by