Proof of the bandwidth conjecture of Bollobás and Komlós
From MaRDI portal
Publication:957895
DOI10.1007/s00208-008-0268-6zbMath1229.05132OpenAlexW1991646384WikidataQ105583359 ScholiaQ105583359MaRDI QIDQ957895
Mathias Schacht, Julia Böttcher, Anusch Taraz
Publication date: 1 December 2008
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00208-008-0268-6
Related Items (43)
On deficiency problems for graphs ⋮ A spanning bandwidth theorem in random graphs ⋮ Spanning trees of dense directed graphs ⋮ Bandwidth, treewidth, separators, expansion, and universality ⋮ On a degree sequence analogue of Pósa's conjecture ⋮ Counting in hypergraphs via regularity inheritance ⋮ Local resilience of spanning subgraphs in sparse random graphs ⋮ Triangle resilience of the square of a Hamilton cycle in random graphs ⋮ On resilience of connectivity in the evolution of random graphs ⋮ Spanning trees in dense directed graphs ⋮ Covering cycles in sparse graphs ⋮ On sufficient conditions for spanning structures in dense graphs ⋮ Hamiltonian cycles with all small even chords ⋮ Bounded-Degree Spanning Trees in Randomly Perturbed Graphs ⋮ A general approach to transversal versions of Dirac‐type theorems ⋮ Recent progress towards Hadwiger's conjecture ⋮ Minimum degree conditions for containing an \(r\)-regular \(r\)-connected spanning subgraph ⋮ On Degree Sequences Forcing The Square of a Hamilton Cycle ⋮ Tree decompositions of graphs without large bipartite holes ⋮ On prisms, Möbius ladders and the cycle space of dense graphs ⋮ A rainbow blow‐up lemma ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ The bandwidth theorem for locally dense graphs ⋮ Minimum degree conditions for monochromatic cycle partitioning ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A blow-up lemma for approximate decompositions ⋮ Embedding Spanning Bipartite Graphs of Small Bandwidth ⋮ Compatible Hamilton cycles in Dirac graphs ⋮ Ramsey numbers of cubes versus cliques ⋮ Ramsey-goodness -- and otherwise ⋮ Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs ⋮ Random perturbation of sparse graphs ⋮ Spanning embeddings of arrangeable graphs with sublinear bandwidth ⋮ On the relation of separability, bandwidth and embedding ⋮ Rainbow factors in hypergraphs ⋮ Tilings in Randomly Perturbed Dense Graphs ⋮ Embedding spanning subgraphs in uniformly dense and inseparable graphs ⋮ Compatible Hamilton cycles in random graphs ⋮ Bandwidth theorem for random graphs ⋮ Almost spanning subgraphs of random graphs after adversarial edge removal ⋮ Minimum degree conditions for large subgraphs ⋮ An Extension of the Blow-up Lemma to Arrangeable Graphs ⋮ On the bandwidth of the Kneser graph
Cites Work
- Unnamed Item
- Unnamed Item
- The Ramsey number of a graph with bounded maximum degree
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- Almost \(H\)-factors in dense graphs
- Proof of the Seymour conjecture for large graphs
- Blow-up lemma
- How tight is the Bollobás-Komlós conjecture?
- Tiling Turán theorems
- 2-factors in dense bipartite graphs
- Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three
- 2-factors in dense graphs
- \(H\)-factors in dense graphs
- Perfect matchings in \(\varepsilon\)-regular graphs and the blow-up lemma
- Large planar subgraphs in dense graphs
- Spanning Trees in Dense Graphs
- Critical chromatic number and the complexity of perfect packings in graphs
- The Blow-up Lemma
- Embedding Arbitrary Graphs of Maximum Degree Two
- Proof of a tiling conjecture of Komlós
- Bandwidth, treewidth, separators, expansion, and universality
- Spanning triangulations in graphs
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- On the structure of linear graphs
- Proof of the Alon-Yuster conjecture
This page was built for publication: Proof of the bandwidth conjecture of Bollobás and Komlós
