The bandwidth theorem for locally dense graphs
From MaRDI portal
Publication:5135412
DOI10.1017/fms.2020.39zbMath1452.05142arXiv1807.09668OpenAlexW2884038503MaRDI QIDQ5135412
Katherine Staden, Andrew Treglown
Publication date: 20 November 2020
Published in: Forum of Mathematics, Sigma (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.09668
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
Related Items
On sufficient conditions for spanning structures in dense graphs, Tiling multipartite hypergraphs in quasi-random hypergraphs, Embedding spanning subgraphs in uniformly dense and inseparable graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on Ramsey-Turán type problems
- Bandwidth theorem for random graphs
- The Ramsey number of a graph with bounded maximum degree
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs
- Proof of the bandwidth conjecture of Bollobás and Komlós
- Weak hypergraph regularity and linear hypergraphs
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs
- Proof of the Seymour conjecture for large graphs
- A local density condition for triangles
- Blow-up lemma
- The minimum degree threshold for perfect graph packings
- Robust Hamiltonicity of random directed graphs
- Spanning embeddings of arrangeable graphs with sublinear bandwidth
- Almost spanning subgraphs of random graphs after adversarial edge removal
- Triangle factors of graphs without large independent sets and of weighted graphs
- On Degree Sequences Forcing The Square of a Hamilton Cycle
- Some exact Ramsey-Turán numbers
- Triangle-Tilings in Graphs Without Large Independent Sets
- A Dirac-Type Theorem for 3-Uniform Hypergraphs
- Embedding spanning subgraphs in uniformly dense and inseparable graphs
- The Blow-up Lemma
- On Perfect Matchings and Tilings in Uniform Hypergraphs
- Embedding Spanning Bipartite Graphs of Small Bandwidth
- A bandwidth theorem for approximate decompositions
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS
- The Bandwidth Theorem in sparse graphs
- A rainbow blow‐up lemma
- Explicit constructions of triple systems for Ramsey–Turán problems
- Some Theorems on Abstract Graphs
- Ramsey-Turán theory
