Asymptotic packing via a branching process

DOI10.1002/RSA.3240070206zbMATH Open0847.60068OpenAlexW2108515073MaRDI QIDQ4847402FDOQ4847402

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

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

Cites Work

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

Cited In (19)

• The number of \(n\)-queens configurations
• New bounds on the size of nearly perfect matchings in almost regular hypergraphs
• Title not available (Why is that?)
• On the random greedy linear uniform hypergraph packing
• On a conjecture of Erdős on locally sparse Steiner triple systems
• Fractional v. integral covers in hypergraphs of bounded edge size
• Nearly perfect matchings in regular simple hypergraphs
• Threshold for Steiner triple systems
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• Exact Packing Measure on the Boundary of a Galton–Watson Tree
• On the power of random greedy algorithms
• On the method of typical bounded differences
• Tuza's conjecture for random graphs
• Random triangle removal
• Prominent examples of flip processes
• Graph and hypergraph colouring via nibble methods: a survey
• A natural barrier in random greedy hypergraph matching
• Inapproximability of \(b\)-matching in \(k\)-uniform hypergraphs
• The reverse \(H\)-free process for strictly 2-balanced graphs

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)