Proof of a Packing Conjecture of Bollobás

DOI10.1017/S0963548300001620zbMath0842.05072OpenAlexW1999445001WikidataQ123028480 ScholiaQ123028480MaRDI QIDQ4862745

Gábor N. Sárközy, János Komlós

Publication date: 17 July 1996

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001620

zbMATH Keywords

treevertex-disjoint pathsconjecture of Bollobáspacking conjectureedge disjoint embeddingfour-layer graphsuper-regular graphupper-regular

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (26)

Spanning trees of dense directed graphs ⋮ Stability for vertex cycle covers ⋮ Blow-up lemma ⋮ Building Spanning Trees Quickly in Maker-Breaker Games ⋮ Spanning trees in dense directed graphs ⋮ Ramsey goodness of trees in random graphs ⋮ Bounded-Degree Spanning Trees in Randomly Perturbed Graphs ⋮ Dirac-type conditions for spanning bounded-degree hypertrees ⋮ Tree decompositions of graphs without large bipartite holes ⋮ A rainbow blow‐up lemma ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On embedding well-separable graphs ⋮ Embedding loose spanning trees in 3-uniform hypergraphs ⋮ Counting oriented trees in digraphs with large minimum semidegree ⋮ Spanning trees in graphs without large bipartite holes ⋮ Spanning subdivisions in Dirac graphs ⋮ On 2-factors with \(k\) components ⋮ Random perturbation of sparse graphs ⋮ Antidirected subgraphs of oriented graphs ⋮ Distributing vertices along a Hamiltonian cycle in Dirac graphs ⋮ Proof of the Seymour conjecture for large graphs ⋮ A fast parallel algorithm for finding Hamiltonian cycles in dense graphs ⋮ Degree Conditions for Embedding Trees ⋮ Cycle factors in dense graphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ Almost-spanning subgraphs with bounded degree in dense graphs

Cites Work

• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• Unnamed Item

This page was built for publication: Proof of a Packing Conjecture of Bollobás