Embedding spanning subgraphs of small bandwidth

DOI10.1016/J.ENDM.2007.07.075MaRDI QIDQ3503507zbMATH OpenOpenAlexFDO

Authors Julia Böttcher, M. 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

zbMATH Keywords

extremal graph theoryregularity lemmaspanning subgraphs

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35)

Recommendations

• Embedding spanning bipartite graphs of small bandwidth
• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Spanning subgraphs of embedded graphs
• Embedding graphs of small size
• Embedding Bounded Bandwidth Graphs into ℓ1
• Embedding spanning subgraphs in uniformly dense and inseparable graphs
• scientific article; zbMATH DE number 1045605
• Embedding spanning bounded degree subgraphs in randomly perturbed graphs
• Graphs with small bandwidth and cutwidth
• Embedding digraphs of small size

Cites work

• scientific article; zbMATH DE number 3641497 (Why is no real title available?)
• scientific article; zbMATH DE number 2086426 (Why is no real title available?)
• scientific article; zbMATH DE number 3441996 (Why is no real title available?)
• Blow-up lemma
• How tight is the Bollobás-Komlós conjecture?
• On the maximal number of independent circuits in a graph
• On the structure of linear graphs
• Proof of the Seymour conjecture for large graphs
• Some Theorems on Abstract Graphs
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• The Blow-up Lemma
• Tiling Turán theorems

Cited in

(8)

• On the bandwidth conjecture for 3-colourable graphs
• Spanning embeddings of arrangeable graphs with sublinear bandwidth
• Embedding spanning bipartite graphs of small bandwidth
• The bandwidth theorem for locally dense graphs
• A spanning bandwidth theorem in random graphs
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• Proof of the bandwidth conjecture of Bollobás and Komlós
• On embedding well-separable graphs

This page was built for publication: Embedding spanning subgraphs of small bandwidth

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