Embedding spanning subgraphs of small bandwidth
From MaRDI portal
Publication:3503507
DOI10.1016/j.endm.2007.07.075zbMath1341.05165OpenAlexW1997392794MaRDI QIDQ3503507
Julia Böttcher, Mathias Schacht, Anusch Taraz
Publication date: 5 June 2008
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.075
Extremal problems in graph theory (05C35) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning 3-colourable subgraphs of small bandwidth 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
- The Blow-up Lemma
- On the maximal number of independent circuits in a graph
- Some Theorems on Abstract Graphs
- On the structure of linear graphs