Abstract
Abstract
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth, thereby showing that separability and bandwidth are not linearly equivalent. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly above n / 2, even though their bandwidth is large.
Funder
Nemzeti Kutatási, Fejlesztési és Innováaciós Hivatal
Emberi Eroforrások Minisztériuma
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference25 articles.
1. Abbasi, S.: How tight is the Bollobás–Komlós conjecture? Graphs Comb. 16, 129–137 (2000)
2. Aigner, M., Brandt, S.: Embedding arbitrary graphs of maximum degree two. J. Lond. Math. Soc. 48, 39–51 (1993)
3. Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley, New York (2008)
4. Bollobás, B., Eldridge, S.E.: Packing of graphs and applications to computational complexity. J. Combin. Theory Ser. B 25, 105–124 (1978)
5. Böttcher, J.: Embedding Large Graphs: The Bollobás–Komlós Conjecture and Beyond. Ph.D. thesis, Technische Universität München (2009)