Corrádi and Hajnal's theorem for sparse random graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1241.05130
DOI: 10.1017/S0963548311000642
author: József Balogh
author: Choongbum Lee
author: Wojciech Samotij
published in: Combinatorics, Probability and Computing
publication date: 2012-05-14T00:00:00Z
full work available at URL: https://arxiv.org/abs/1011.5443
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C42
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6034346
zbMATH Keywords: triangle packings
zbMATH Keywords: perfect \(H\)-packing
Wikidata QID: Q105583908
MaRDI profile type: Publication
arXiv ID: 1011.5443
cites work: Matching and covering the vertices of a random graph by copies of a given graph
cites work: Hamiltonian circuits in random graphs
cites work: Perfect matchings in random uniform hypergraphs
cites work: Factors in random graphs
cites work: Bandwidth theorem for random graphs
cites work: On Representatives of Subsets
cites work: On the maximal number of independent circuits in a graph
cites work: On two Hamilton cycle problems in random graphs
cites work: Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs
cites work: Some Theorems on Abstract Graphs
cites work: Local resilience of almost spanning trees in random graphs
cites work: \(H\)-factors in dense graphs
cites work: Threshold Functions for H-factors
cites work: Almost \(H\)-factors in dense graphs
cites work: Triangle factors in sparse pseudo-random graphs
cites work: Resilient Pancyclicity of Random and Pseudorandom Graphs
cites work: Triangle Factors in Random Graphs
cites work: Proof of the Alon-Yuster conjecture
cites work: Blow-up lemma
cites work: Regular pairs in sparse random graphs I
cites work: On \(K^ 4\)-free subgraphs of random graphs
cites work: Local resilience of graphs
title: Corrádi and Hajnal's theorem for sparse random graphs
description: scientific article; zbMATH DE number 6034346