Corrádi and Hajnal's Theorem for Sparse Random Graphs
From MaRDI portal
Publication:2883851
DOI10.1017/S0963548311000642zbMath1241.05130arXiv1011.5443WikidataQ105583908 ScholiaQ105583908MaRDI QIDQ2883851
Wojciech Samotij, Choongbum Lee, József Balogh
Publication date: 14 May 2012
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1011.5443
Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)
Related Items (12)
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs ⋮ Local resilience of spanning subgraphs in sparse random graphs ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Covering cycles in sparse graphs ⋮ A Dirac-type theorem for Berge cycles in random hypergraphs ⋮ On the KŁR conjecture in random graphs ⋮ A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs ⋮ On Komlós’ tiling theorem in random graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Dirac’s theorem for random regular graphs ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight)
Cites Work
- Triangle factors in sparse pseudo-random graphs
- Bandwidth theorem for random graphs
- On two Hamilton cycle problems in random graphs
- Almost \(H\)-factors in dense graphs
- Matching and covering the vertices of a random graph by copies of a given graph
- Hamiltonian circuits in random graphs
- Blow-up lemma
- On \(K^ 4\)-free subgraphs of random graphs
- \(H\)-factors in dense graphs
- Local resilience of almost spanning trees in random graphs
- Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
- Resilient Pancyclicity of Random and Pseudorandom Graphs
- Factors in random graphs
- Local resilience of graphs
- Threshold Functions for H-factors
- Triangle Factors in Random Graphs
- Regular pairs in sparse random graphs I
- Perfect matchings in random uniform hypergraphs
- On Representatives of Subsets
- 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: Corrádi and Hajnal's Theorem for Sparse Random Graphs
