Asymptotic packing via a branching process

DOI10.1002/RSA.3240070206zbMath0847.60068OpenAlexW2108515073MaRDI QIDQ4847402

J. H. Spencer

Publication date: 24 September 1996

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240070206

zbMATH Keywords

greedy algorithmoptimal packing

Mathematics Subject Classification ID

Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (17)

On the power of random greedy algorithms ⋮ Fractional v. integral covers in hypergraphs of bounded edge size ⋮ Nearly perfect matchings in regular simple hypergraphs ⋮ Tuza's conjecture for random graphs ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ The number of \(n\)-queens configurations ⋮ New bounds on the size of nearly perfect matchings in almost regular hypergraphs ⋮ Threshold for Steiner triple systems ⋮ Prominent examples of flip processes ⋮ On the Method of Typical Bounded Differences ⋮ Unnamed Item ⋮ On a conjecture of Erdős on locally sparse Steiner triple systems ⋮ New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help ⋮ Inapproximability of b-Matching in k-Uniform Hypergraphs ⋮ A natural barrier in random greedy hypergraph matching ⋮ The Reverse H‐free Process for Strictly 2‐Balanced Graphs ⋮ Random triangle removal

Cites Work

• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem

This page was built for publication: Asymptotic packing via a branching process