Packing tree factors in random and pseudo-random graphs

zbMath1300.05242arXiv1304.2429MaRDI QIDQ405193

Deepak Bal, Michael Krivelevich, Po-Shen Loh, Alan M. Frieze

Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.2429

zbMATH Keywords

random graphspackingpseudo-random graphstree factors

Mathematics Subject Classification ID

Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (3)

An approximate version of the tree packing conjecture ⋮ Packing spanning graphs from separable families ⋮ Optimal packings of bounded degree trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On two Hamilton cycle problems in random graphs
• On factors in random graphs
• On packing Hamilton cycles in \(\varepsilon\)-regular graphs
• Hamilton decompositions of regular expanders: applications
• Packing tight Hamilton cycles in 3-uniform hypergraphs
• Packing hamilton cycles in random and pseudo-random hypergraphs
• Packing Tight Hamilton Cycles in Uniform Hypergraphs
• Approximate Hamilton decompositions of random graphs
• Tree-Matchings in Graph Processes
• Optimal Packings of Hamilton Cycles in Sparse Random Graphs
• Edge-disjoint Hamilton cycles in random graphs
• On the existence of a factor of degree one of a connected random graph

This page was built for publication: Packing tree factors in random and pseudo-random graphs