LSE creators

Number of items: 58.
LSE
  • Allen, Peter, Böttcher, Julia, Skokan, Jozef (2017). Report of the large-scale Structures in random graphs workshop.
    • Mathematics
  • Allen, Peter, Böttcher, Julia, Katz, Jasmin (2025). Universality for degenerate hypergraphs. Procedia Computer Science, 273, 381-388. https://doi.org/10.1016/j.procs.2025.10.322 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2025). Blow-up lemmas for sparse graphs. Discrete Analysis, 2025(8). https://doi.org/10.19086/da.143410 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Lang, Richard, Skokan, Jozef, Stein, Maya (2024). Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles. European Journal of Combinatorics, 121, https://doi.org/10.1016/j.ejc.2023.103838 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2024). The square of a Hamilton cycle in randomly perturbed graphs. Random Structures and Algorithms, 65(2), 342 - 386. https://doi.org/10.1002/rsa.21215 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Corsten, Jan, Davies, Ewan, Jenssen, Matthew, Morris, Patrick, Roberts, Barnaby, Skokan, Jozef (2024). A robust Corrádi–Hajnal theorem. Random Structures and Algorithms, 65(1), 61-130. https://doi.org/10.1002/rsa.21209 picture_as_pdf
  • Böttcher, Julia (2023). Graph and hypergraph packing. In Beliaev, Dmitry, Smirnov, Stanislav (Eds.), International Congress of Mathematicians, 2022 July 6–14 (pp. 4542 - 4566). EMS Press. https://doi.org/10.4171/icm2022/136 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2023). Triangles in randomly perturbed graphs. Combinatorics, Probability and Computing, 32(1), 91 - 121. https://doi.org/10.1017/S0963548322000153 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Clemens, Dennis, Taraz, Anusch (2022). Perfectly packing graphs with bounded degeneracy and many leaves. Israel Journal of Mathematics, https://doi.org/10.1007/s11856-022-2447-7 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Ehrenmüller, Julia, Schnitzer, Jakob, Taraz, Anusch (2022). A spanning bandwidth theorem in random graphs. Combinatorics Probability and Computing, 31(4), 598 - 628. https://doi.org/10.1017/S0963548321000481 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2022). Cycle factors in randomly perturbed graphs. Procedia Computer Science, 195, 404 - 411. https://doi.org/10.1016/j.procs.2021.11.049 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hng, Eng Keat, Skokan, Jozef, Davies, Ewan (2022). An approximate blow-up lemma for sparse hypergraphs. Procedia Computer Science, 195, 394 - 403. https://doi.org/10.1016/j.procs.2021.11.048 picture_as_pdf
  • Böttcher, Julia, Parczyk, Olaf, Sgueglia, Amedeo, Skokan, Jozef (2021). The square of a Hamilton cycle in randomly perturbed graphs. In Nešetřil, Jaroslav, Perarnau, Guillem, Rué, Juanjo, Serra, Oriol (Eds.), Extended Abstracts EuroComb 2021: European Conference on Combinatorics, Graph Theory and Applications (pp. 644 - 650). Birkhäuser (Firm). https://doi.org/10.1007/978-3-030-83823-2_103 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Ehrenmüller, Julia, Taraz, Anusch (2020). The bandwidth theorem in sparse graphs. Advances in Combinatorics, 2020(1), 1 - 60. https://doi.org/10.19086/aic.12849 picture_as_pdf
  • Böttcher, Julia, Montgomery, Richard, Parczyk, Olaf, Person, Yury (2020). Embedding spanning bounded degree graphs in randomly perturbed graphs. Mathematika, 66(2), 422 - 447. https://doi.org/10.1112/mtk.12005 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Skokan, Jozef, Stein, Maya (2020). Regularity inheritance in pseudorandom graphs. Random Structures and Algorithms, 56(2), 306 - 338. https://doi.org/10.1002/rsa.20851 picture_as_pdf
  • Böttcher, Julia, Han, Jie, Kohayakawa, Yoshiharu, Montgomery, Richard, Parczyk, Olaf, Person, Yury (2019). Universality for bounded degree spanning trees in randomly perturbed graphs. Random Structures and Algorithms, 55(4), 854-864. https://doi.org/10.1002/rsa.20850 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2019). Packing degenerate graphs. Advances in Mathematics, 354, https://doi.org/10.1016/j.aim.2019.106739 picture_as_pdf
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu, Morris, Robert (2017). Chromatic thresholds in sparse random graphs. Random Structures and Algorithms, 51(2), 215-236. https://doi.org/10.1002/rsa.20709
  • Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu, Roberts, Barnaby (2017). Triangle-free subgraphs of random graphs. Combinatorics, Probability and Computing, 27(2), 141-161. https://doi.org/10.1017/S0963548317000219
  • Böttcher, Julia, Montgomery, Richard, Parczyk, Olaf, Person, Yury (2017). Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electronic Notes in Discrete Mathematics, 61, 155-161. https://doi.org/10.1016/j.endm.2017.06.033
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2017). Packing degenerate graphs greedily. Electronic Notes in Discrete Mathematics, 61, 45-51. https://doi.org/10.1016/j.endm.2017.06.019
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2017). Powers of Hamilton cycles in pseudorandom graphs. Combinatorica, 37(4), 573-616. https://doi.org/10.1007/s00493-015-3228-2
  • Böttcher, Julia (2017). Large-scale structures in random graphs. In Claesson, Anders, Dukes, Mark, Kitaev, Sergei, Manlove, David, Meeks, Kitty (Eds.), Surveys in Combinatorics 2017 (pp. 87-140). Cambridge University Press. https://doi.org/10.1017/9781108332699.003
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu, Morris, Robert (2017). Chromatic thresholds in dense random graphs. Random Structures and Algorithms, 51(2), 185 - 214. https://doi.org/10.1002/rsa.20708
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2017). Tight cycles and regular slices in dense hypergraphs. Journal of Combinatorial Theory, Series A, 149, 30-100. https://doi.org/10.1016/j.jcta.2017.01.003
  • Böttcher, Julia (2017). vvv.
  • Böttcher, Julia, Hladký, Jan, Piguet, Diana, Taraz, Anusch (2016). An approximate version of the tree packing conjecture. Israel Journal of Mathematics, 211(1), 391-446. https://doi.org/10.1007/s11856-015-1277-2
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2015). Regular slices for hypergraphs. Electronic Notes in Discrete Mathematics, 49, 691-698. https://doi.org/10.1016/j.endm.2015.06.093
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2015). A density Corrádi-Hajnal theorem. Canadian Journal of Mathematics, 67(4), 721-758. https://doi.org/10.4153/CJM-2014-030-6
  • Böttcher, Julia, Kohayakawa, Yoshiharu, Taraz, Anusch, Würfl, Andreas (2015). An extension of the blow-up lemma to arrangeable graphs. SIAM Journal on Discrete Mathematics, 29(2), 962-1001. https://doi.org/10.1137/13093827X
  • Allen, Peter, Böttcher, Julia, Kohayakawa, Yoshiharu, Person, Yury (2015). Tight Hamilton cycles in random hypergraphs. Random Structures and Algorithms, 46(3), 446-465. https://doi.org/10.1002/rsa.20519
  • Böttcher, Julia, Taraz, Anusch, Würfl, Andreas (2015). Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Structures and Algorithms, 48(2), 270-289. https://doi.org/10.1002/rsa.20593
  • Allen, Peter, Böttcher, Julia, Ehrenmüller, Julia, Taraz, Anusch (2015-08-31 - 2015-09-04) Local resilience of spanning subgraphs in sparse random graphs [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Böttcher, Julia, Cooley, Oliver, Mycroft, Richard (2015-08-31 - 2015-09-04) Tight cycles in hypergraphs [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Böttcher, Julia, Roberts, Barnaby, Kohayakawa, Yoshiharu (2015-08-31 - 2015-09-04) Triangle-free subgraphs of random graphs [Paper]. European Conference on Combinatorics, Graph Theory and Applications, Bergen, Norway, NOR.
  • Allen, Peter, Böttcher, Julia, Person, Yury (2014). An improved error term for minimum H-decompositions of graphs. Journal of Combinatorial Theory, Series B, 108, 92-101. https://doi.org/10.1016/j.jctb.2014.03.001
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2014). Powers of hamilton cycles in pseudorandom graphs. LATIN 2014: Theoretical Informatics, 8392(30), 355-366. https://doi.org/10.1007/978-3-642-54423-1_31
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Piguet, Diana (2014). An extension of Turán's theorem, uniqueness and stability. Electronic Journal of Combinatorics, 21(4), P4.5.
  • Böttcher, Julia, Kohayakawa, Yoshiharu, Taraz, Anusch (2013). Almost spanning subgraphs of random graphs after adversarial edge removal. Combinatorics, Probability and Computing, 22(5), 639-683. https://doi.org/10.1017/S0963548313000199
  • Allen, Peter, Böttcher, Julia, Griffiths, Simon, Kohayakawa, Yoshiharu (2013). The chromatic threshold of graphs. Advances in Mathematics, 235, 261-295. https://doi.org/10.1016/j.aim.2012.11.016
  • Böttcher, Julia, Foniok, Jan (2013). Ramsey properties of permutations. Electronic Journal of Combinatorics, 20(1).
  • Allen, Peter, Böttcher, Julia, Hàn, Hiệp, Kohayakawa, Yoshiharu, Person, Yury (2013). An approximate blow-up lemma for sparse pseudorandom graphs. Electronic Notes in Discrete Mathematics, 44, 393-398. https://doi.org/10.1016/j.endm.2013.10.061
  • Böttcher, Julia, Taraz, Anusch, Würfl, Andreas (2012). Perfect graphs of fixed density: counting and homogeneous sets. Combinatorics, Probability and Computing, 21(5), 661-682. https://doi.org/10.1017/S0963548312000181
  • Allen, Peter, Böttcher, Julia, Hladky, Jan (2011). Filling the gap between Turan's theorem and Posa's conjecture. Journal of the London Mathematical Society, 84(2), 269-302. https://doi.org/10.1112/jlms/jdr007
  • Böttcher, Julia, Kohayakawa, Yoshiharu, Procacci, Aldo (2011). Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Structures and Algorithms, 40(4), 425-436. https://doi.org/10.1002/rsa.20383
  • Böttcher, Julia, Pruessmann, Klaas P., Taraz, Anusch, Würfl, Andreas (2010). Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. European Journal of Combinatorics, 31(5), 1217-1227. https://doi.org/10.1016/j.ejc.2009.10.010
  • Böttcher, Julia, Heinig, Peter, Taraz, Anusch (2010). Embedding into bipartite graphs. SIAM Journal on Discrete Mathematics, 24(4), 1215-1233. https://doi.org/10.1137/090765481
  • Allen, Peter, Böttcher, Julia, Hladký, Jan, Cooley, Oliver (2009). Minimum degree conditions for large subgraphs. Electronic Notes in Discrete Mathematics, 34, 75-79. https://doi.org/10.1016/j.endm.2009.07.013
  • Böttcher, Julia, Hladký, Jan, Piguet, Diana (2009). The tripartite Ramsey number for trees. Electronic Notes in Discrete Mathematics, 34, 597-601. https://doi.org/10.1016/j.endm.2009.07.101
  • Böttcher, Julia, Kohayakawa, Yoshiharu, Taraz, Anusch (2009). Almost spanning subgraphs of random graphs after adversarial edge removal. Electronic Notes in Discrete Mathematics, 35, 335-340. https://doi.org/10.1016/j.endm.2009.11.055
  • Böttcher, Julia, Müller, Sybille (2009). Forcing spanning subgraphs via Ore type conditions. Electronic Notes in Discrete Mathematics, 34, 255-259. https://doi.org/10.1016/j.endm.2009.07.042
  • Böttcher, Julia, Schacht, Mathais, Taraz, Anusch (2009). Proof of the bandwidth conjecture of Bollobás and Komlós. Mathematische Annalen, 343(1), 175-205. https://doi.org/10.1007/s00208-008-0268-6
  • Böttcher, Julia, Pruessmann, Klaas P., Taraz, Anusch, Würfl, Andreas (2008). Bandwidth, treewidth, separators, expansion, and universality. Electronic Notes in Discrete Mathematics, 31, 91-96. https://doi.org/10.1016/j.endm.2008.06.018
  • Böttcher, Julia, Vilenchik, Dan (2008). On the tractability of coloring semirandom graphs. Information Processing Letters, 108(3), 143-149. https://doi.org/10.1016/j.ipl.2008.04.011
  • Böttcher, Julia, Schacht, Mathias, Taraz, Anusch (2008). Spanning 3-colourable subgraphs of small bandwidth in dense graphs. Journal of Combinatorial Theory, Series B, 98(4), 752-777. https://doi.org/10.1016/j.jctb.2007.11.005
  • Böttcher, Julia, Schacht, Mathais, Taraz, Anusch (2007). On the bandwidth conjecture for 3-colourable graphs. In Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 618-626). Society for Industrial and Applied Mathematics.
  • Böttcher, Julia (2005). Coloring sparse random k-colorable graphs in polynomial expected time. In Je¸drzejowicz, Joanna, Szepietowski, Andrzej (Eds.), Mathematical Foundations of Computer Science 2005: 30th International Symposium, Mfcs 2005, Gdansk, Poland, August 29–september (pp. 156-167). Springer Berlin / Heidelberg. https://doi.org/10.1007/11549345_15