Proof of the bandwidth conjecture of Bollobás and Komlós

Mathematische Annalen

Volumn 343, Issue 1, 2009, Pages 175-205

  Böttcher, Julia ^a   Schacht, Mathias ^b   Taraz, Anusch ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 54049112981     PISSN: 00255831     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00208-008-0268-6     Document Type: Article

References (34)

1. Abbasi, S.: Embedding low bandwidth bipartite graphs, unpublished
2. S. Abbasi 2000 How tight is the Bollobás-Komlós conjecture? Graphs Combin 16 2 129 137
3. M. Aigner S. Brandt 1993 Embedding arbitrary graphs of maximum degree two J. Lond. Math. Soc. (2) 48 1 39 51
4. N. Alon E. Fischer 1996 2-Factors in dense graphs Discrete Math. 152 1-3 13 23
5. N. Alon R. Yuster 1992 Almost H-factors in dense graphs Graphs Combin. 8 2 95 102
6. N. Alon R. Yuster 1996 H-factors in dense graphs J. Combin. Theory Ser. B 66 2 269 282
7. Böttcher, J., Pruessmann, K.P., Taraz, A., Würfl, A.: Bandwidth, treewidth, separators, expansion, and universality, Electron. Notes Discrete Math. (2008) (to appear)
8. J. Böttcher M. Schacht A. Taraz 2008 Spanning 3-colourable subgraphs of small bandwidth in dense graphs J. Combin. Theory Ser. B 98 4 752 777
9. Chung, F.R.K.: Labelings of graphs, Selected Topics in Graph Theory, vol. 3, pp. 151-168. Academic Press, London (1988)
10. V. Chvátal V. Rödl E. Szemerédi W.T. Trotter Jr 1983 The Ramsey number of a graph with bounded maximum degree J. Combin. Theory Ser. B 34 3 239 243
11. K. Corradi A. Hajnal 1963 On the maximal number of independent circuits in a graph Acta Math. Acad. Sci. Hungar. 14 423 439
12. Csaba, B., Shokoufandeh, A., Szemerédi, E.: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three. Combinatorica 23(1), 35-72 (2003), Paul Erdos and his mathematics (Budapest 1999)
13. A. Czygrinow H.A. Kierstead 2002 2-factors in dense bipartite graphs Discrete Math. 257 2-3 357 369 Kleitman and combinatorics: a celebration (Cambridge, MA, 1999)
14. Diestel R.: Graph theory, 3rd edn., Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2005)
15. G.A. Dirac 1952 Some theorems on abstract graphs Proc. London Math. Soc. (3) 2 69 81
16. Erdos, P.: Problem 9, Theory of Graphs and its Applications. In: Fiedler, M. (ed.) Proceedings of Symposium on Smolenice 1963, p. 159. Publ. House Czechoslovak Academic Science, Prague (1964)
17. P. Erdös A.H. Stone 1946 On the structure of linear graphs Bull. Am. Math. Soc. 52 1087 1091
18. Hajnal, A., Szemerédi, E.: Proof of a conjecture of P. Erdos, Combinatorial theory and its applications, II. In: Proceedings of Colloq., Balatonfüred 1969, pp. 601-623. North-Holland, Amsterdam (1970)
19. Hàn, H.: Einbettungen bipartiter Graphen mit kleiner Bandbreite. Master's thesis, Humboldt-Universität zu Berlin, Institut für Informatik, Fall (2006)
20. J. Komlós 1999 The blow-up lemma Combin. Probab. Comput. 8 1-2 161 176 Recent trends in combinatorics (Mátraháza, 1995)
21. J. Komlós 2000 Tiling Turán theorems Combinatorica 20 2 203 218
22. J. Komlós G.N. Sárközy E. Szemerédi 1997 Blow-up lemma Combinatorica 17 1 109 123
23. J. Komlós G.N. Sárközy E. Szemerédi 1998 Proof of the Seymour conjecture for large graphs Ann. Comb. 2 1 43 60
24. J. Komlós G.N. Sárközy E. Szemerédi 2001 Proof of the Alon-Yuster conjecture Discrete Math. 235 1-3 255 269
25. J. Komlós G.N. Sárközy E. Szemerédi 2001 Spanning trees in dense graphs Combin. Probab. Comput. 10 5 397 416
26. Komlós, J., Simonovits, M.: Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, Paul Erdos is eighty, vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud., vol. 2, pp. 295-352. János Bolyai Mathematical Society, Budapest (1996)
27. Kühn, D., Osthus, D.: The minimum degree threshold for perfect graph packings. Combinatorica (to appear)
28. D. Kühn D. Osthus 2005 Spanning triangulations in graphs J. Graph. Theory 49 3 205 233
29. Kühn, D., Osthus, D.: Critical chromatic number and the complexity of perfect packings in graphs. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, 22-26 January 2006, pp. 851-859. ACM Press (2006)
30. D. Kühn D. Osthus A. Taraz 2005 Large planar subgraphs in dense graphs J. Combin. Theory Ser. B 95 2 263 282
31. V. Rödl A. Ruciński 1999 Perfect matchings in ε-regular graphs and the blow-up lemma Combinatorica 19 3 437 452
32. Seymour, P.: Problem section, Combinatorics. In: McDonough, T.P., Mavron, V.C. (eds.) Proceedings of British Combinatorial Conference 1973.Lecture Note Ser., No. 13, pp. 201-204. London Mathematical Society, Cambridge University Press, London (1974)
33. A. Shokoufandeh Y. Zhao 2003 Proof of a tiling conjecture of Komlós Random Struct. Algorithms 23 2 180 205
34. Szemerédi, E.: Regular partitions of graphs, Problèmes combinatoires et théorie des graphes (Orsay, 1976), Colloques Internationaux CNRS, vol. 260, pp. 399-401. CNRS (1978)