Proof of a Packing Conjecture of Bollobás

DOI10.1017/S0963548300001620MaRDI QIDQ4862745zbMATH OpenOpenAlexWikidataFDO

Authors János Komlós, Gábor N. Sárközy, Endre Szemerédi

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 pathspacking conjectureconjecture of Bollobásedge 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)

Recommendations

• On a graph packing conjecture by Bollobás, Eldridge and Catlin
• On packing measures and a theorem of Besicovitch
• On a conjecture of Croft, Falconer and Guy on finite packings
• A proof of the finite filling conjecture
• scientific article; zbMATH DE number 2068123
• scientific article; zbMATH DE number 4032509
• Proof of a conjecture of Bollobás on nested cycles
• Polynomials and packings: A new proof of de Bruijn's theorem
• The packing measure and Fubini's theorem
• On Packing of Minkowski Balls

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity

Cited in

(29)

• An extension of the blow-up lemma to arrangeable graphs
• On 2-factors with \(k\) components
• Antidirected subgraphs of oriented graphs
• Spanning trees in dense directed graphs
• Embedding loose spanning trees in 3-uniform hypergraphs
• scientific article; zbMATH DE number 4019895 (Why is no real title available?)
• Counting oriented trees in digraphs with large minimum semidegree
• A simple proof of the shallow packing lemma
• Stability for vertex cycle covers
• Almost-spanning subgraphs with bounded degree in dense graphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• A rainbow blow-up lemma
• Building spanning trees quickly in maker-breaker games
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• On embedding well-separable graphs
• Random perturbation of sparse graphs
• Blow-up lemma
• Proof of the Seymour conjecture for large graphs
• Degree conditions for embedding trees
• Cycle factors in dense graphs
• On the Bollobás–Eldridge Conjecture for Bipartite Graphs
• Spanning trees in graphs without large bipartite holes
• A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
• Tree decompositions of graphs without large bipartite holes
• Spanning trees of dense directed graphs
• Spanning subdivisions in Dirac graphs
• Dirac-type conditions for spanning bounded-degree hypertrees
• Distributing vertices along a Hamiltonian cycle in Dirac graphs
• Ramsey goodness of trees in random graphs

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

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