Proof of a Packing Conjecture of Bollobás
DOI10.1017/S0963548300001620zbMATH Open0842.05072OpenAlexW1999445001WikidataQ123028480 ScholiaQ123028480MaRDI QIDQ4862745FDOQ4862745
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
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
treevertex-disjoint pathspacking conjectureconjecture of Bollobásedge disjoint embeddingfour-layer graphsuper-regular graphupper-regular
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)
Cites Work
Cited In (29)
- Embedding loose spanning trees in 3-uniform hypergraphs
- Counting oriented trees in digraphs with large minimum semidegree
- Almost-spanning subgraphs with bounded degree in dense graphs
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- On the Bollobás–Eldridge Conjecture for Bipartite Graphs
- On 2-factors with \(k\) components
- Tree decompositions of graphs without large bipartite holes
- Spanning trees of dense directed graphs
- A simple proof of the shallow packing lemma
- Building spanning trees quickly in maker-breaker games
- Proof of the Seymour conjecture for large graphs
- Spanning trees in dense directed graphs
- A rainbow blow‐up lemma
- An extension of the blow-up lemma to arrangeable graphs
- Blow-up lemma
- Cycle factors in dense graphs
- Distributing vertices along a Hamiltonian cycle in Dirac graphs
- Dirac-type conditions for spanning bounded-degree hypertrees
- Spanning trees in graphs without large bipartite holes
- Spanning subdivisions in Dirac graphs
- Antidirected subgraphs of oriented graphs
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- Degree Conditions for Embedding Trees
- Ramsey goodness of trees in random graphs
- Title not available (Why is that?)
- Stability for vertex cycle covers
- Random perturbation of sparse graphs
- On embedding well-separable graphs
- Bounded-Degree Spanning Trees in Randomly Perturbed 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)
