How tight is the Bollobás-Komlós conjecture?
From MaRDI portal
Publication:1576569
zbMath0961.05037MaRDI QIDQ1576569
Publication date: 28 May 2001
Published in: Graphs and Combinatorics (Search for Journal in Brave)
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)
Related Items (7)
Embedding spanning subgraphs of small bandwidth ⋮ Vertex-disjoint cycles of the same length. ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Spanning 3-colourable subgraphs of small bandwidth in dense graphs ⋮ Proof of the bandwidth conjecture of Bollobás and Komlós ⋮ On the relation of separability, bandwidth and embedding ⋮ Almost-spanning subgraphs with bounded degree in dense graphs
This page was built for publication: How tight is the Bollobás-Komlós conjecture?
