How tight is the Bollobás-Komlós conjecture?

zbMATH Open0961.05037MaRDI QIDQ1576569FDOQ1576569

Authors: Sarmad Abbasi 

Publication date: 28 May 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Recommendations

• Proof of the bandwidth conjecture of Bollobás and Komlós
• Embedding spanning subgraphs of small bandwidth
• Embedding into Bipartite Graphs
• Embedding spanning bipartite graphs of small bandwidth
• On the bandwidth conjecture for \(3\)-colourable graphs

zbMATH Keywords

bandwidthBollobás-Komlós conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cited In (9)

• 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
• Vertex-disjoint cycles of the same length.
• Embedding spanning bipartite graphs of small bandwidth
• Embedding spanning subgraphs of small bandwidth
• Spanning 3-colourable subgraphs of small bandwidth in dense graphs
• On the relation of separability, bandwidth and embedding
• Proof of the bandwidth conjecture of Bollobás and Komlós

This page was built for publication: How tight is the Bollobás-Komlós conjecture?

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