| Proof of the bandwidth conjecture of Bollobás and Komlós J Böttcher, M Schacht, A Taraz Mathematische Annalen 343 (1), 175-205, 2009 | 103 | 2009 |
| Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs J Böttcher, KP Pruessmann, A Taraz, A Würfl European Journal of Combinatorics 31 (5), 1217-1227, 2010 | 68 | 2010 |
| Universality for bounded degree spanning trees in randomly perturbed graphs J Böttcher, J Han, Y Kohayakawa, R Montgomery, O Parczyk, Y Person Random Structures & Algorithms 55 (4), 854-864, 2019 | 60 | 2019 |
| Embedding spanning bounded degree graphs in randomly perturbed graphs J Böttcher, R Montgomery, O Parczyk, Y Person Mathematika 66 (2), 422-447, 2020 | 55 | 2020 |
| Blow-up lemmas for sparse graphs P Allen, J Böttcher, H Hàn, Y Kohayakawa, Y Person arXiv preprint arXiv:1612.00622, 2016 | 53 | 2016 |
| The chromatic thresholds of graphs P Allen, J Böttcher, S Griffiths, Y Kohayakawa, R Morris Advances in Mathematics 235, 261-295, 2013 | 44 | 2013 |
| Properly coloured copies and rainbow copies of large graphs with small maximum degree J Böttcher, Y Kohayakawa, A Procacci Random Structures & Algorithms 40 (4), 425-436, 2012 | 42 | 2012 |
| Tight cycles and regular slices in dense hypergraphs P Allen, J Böttcher, O Cooley, R Mycroft Journal of Combinatorial Theory, Series A 149, 30-100, 2017 | 38 | 2017 |
| An approximate version of the tree packing conjecture J Böttcher, J Hladký, D Piguet, A Taraz Israel journal of mathematics 211 (1), 391-446, 2016 | 35 | 2016 |
| Tight Hamilton cycles in random hypergraphs P Allen, J Böttcher, Y Kohayakawa, Y Person Random Structures & Algorithms 46 (3), 446-465, 2015 | 28 | 2015 |
| The bandwidth theorem in sparse graphs P Allen, J Böttcher, J Ehrenmüller, A Taraz arXiv preprint arXiv:1612.00661, 2016 | 27 | 2016 |
| Almost spanning subgraphs of random graphs after adversarial edge removal J Böttcher, Y Kohayakawa, A Taraz Combinatorics, Probability and Computing 22 (5), 639-683, 2013 | 27 | 2013 |
| Almost spanning subgraphs of random graphs after adversarial edge removal J Böttcher, Y Kohayakawa, A Taraz Electronic Notes in Discrete Mathematics 35, 335-340, 2009 | 24 | 2009 |
| Packing degenerate graphs P Allen, J Böttcher, J Hladký, D Piguet Advances in Mathematics 354, 106739, 2019 | 23 | 2019 |
| Large-scale structures in random graphs. J Böttcher BCC, 87-140, 2017 | 23 | 2017 |
| Spanning 3-colourable subgraphs of small bandwidth in dense graphs J Böttcher, M Schacht, A Taraz Journal of Combinatorial Theory, Series B 98 (4), 752-777, 2008 | 23 | 2008 |
| A density Corrádi–Hajnal theorem P Allen, J Böttcher, J Hladký, D Piguet Canadian Journal of Mathematics 67 (4), 721-758, 2015 | 18 | 2015 |
| Powers of Hamilton cycles in pseudorandom graphs P Allen, J Böttcher, H Hàn, Y Kohayakawa, Y Person Combinatorica 37, 573-616, 2017 | 17 | 2017 |
| Ramsey properties of permutations J Böttcher, J Foniok arXiv preprint arXiv:1103.5686, 2011 | 16 | 2011 |
| Triangles in randomly perturbed graphs J Böttcher, O Parczyk, A Sgueglia, J Skokan Combinatorics, Probability and Computing 32 (1), 91-121, 2023 | 13 | 2023 |
