Asymptotic packing via a branching process

DOI10.1002/RSA.3240070206MaRDI QIDQ4847402zbMATH OpenOpenAlexFDO

Authors Joel 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)

Cites work

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

Cited in

(21)

• Fractional v. integral covers in hypergraphs of bounded edge size
• Nearly perfect matchings in regular simple hypergraphs
• On the power of random greedy algorithms
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Random triangle removal
• Inapproximability of b-matching in k-uniform hypergraphs
• scientific article; zbMATH DE number 4109789 (Why is no real title available?)
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• Exact Packing Measure on the Boundary of a Galton–Watson Tree
• A natural barrier in random greedy hypergraph matching
• The reverse \(H\)-free process for strictly 2-balanced graphs
• On the method of typical bounded differences
• On the random greedy linear uniform hypergraph packing
• 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
• Efficient polynomial-time approximation scheme for the genus of dense graphs
• High-girth Steiner triple systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4847402)