Items where Author is "Böttcher, Julia"

Number of items: 57.
Article
  • Blow-up lemmas for sparse graphs. (2024) Allen, Peter and Böttcher, Julia and Hàn, Hiệp and Kohayakawa, Yoshiharu and Person, Yury picture_as_pdf
  • Perfectly packing graphs with bounded degeneracy and many leaves. (2022) Allen, Peter and Böttcher, Julia and Clemens, Dennis and Taraz, Anusch picture_as_pdf
  • Almost spanning subgraphs of random graphs after adversarial edge removal. Böttcher, Julia and Kohayakawa, Yoshiharu and Taraz, Anusch
  • Almost spanning subgraphs of random graphs after adversarial edge removal. Böttcher, Julia and Kohayakawa, Yoshiharu and Taraz, Anusch
  • Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Böttcher, Julia and Pruessmann, Klaas P. and Taraz, Anusch and Würfl, Andreas
  • Bandwidth, treewidth, separators, expansion, and universality. Böttcher, Julia and Pruessmann, Klaas P. and Taraz, Anusch and Würfl, Andreas
  • Chromatic thresholds in dense random graphs. Allen, Peter and Böttcher, Julia and Griffiths, Simon and Kohayakawa, Yoshiharu and Morris, Robert
  • Chromatic thresholds in sparse random graphs. Allen, Peter and Böttcher, Julia and Griffiths, Simon and Kohayakawa, Yoshiharu and Morris, Robert
  • Cycle factors in randomly perturbed graphs. Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amedeo and Skokan, Jozef picture_as_pdf
  • Embedding into bipartite graphs. Böttcher, Julia and Heinig, Peter and Taraz, Anusch
  • Embedding spanning bounded degree graphs in randomly perturbed graphs. Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury picture_as_pdf
  • Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Böttcher, Julia and Montgomery, Richard and Parczyk, Olaf and Person, Yury
  • Filling the gap between Turan's theorem and Posa's conjecture. Allen, Peter and Böttcher, Julia and Hladky, Jan
  • Forcing spanning subgraphs via Ore type conditions. Böttcher, Julia and Müller, Sybille
  • Minimum degree conditions for large subgraphs. Allen, Peter and Böttcher, Julia and Hladký, Jan and Cooley, Oliver
  • On the tractability of coloring semirandom graphs. Böttcher, Julia and Vilenchik, Dan
  • Packing degenerate graphs. Allen, Peter and Böttcher, Julia and Hladký, Jan and Piguet, Diana picture_as_pdf
  • Packing degenerate graphs greedily. Allen, Peter and Böttcher, Julia and Hladký, Jan and Piguet, Diana
  • Partitioning a 2-edge-coloured graph of minimum degree 2n/3 + o(n) into three monochromatic cycles. Allen, Peter and Böttcher, Julia and Lang, Richard and Skokan, Jozef and Stein, Maya picture_as_pdf
  • Perfect graphs of fixed density: counting and homogeneous sets. Böttcher, Julia and Taraz, Anusch and Würfl, Andreas
  • Powers of Hamilton cycles in pseudorandom graphs. Allen, Peter and Böttcher, Julia and Hàn, Hiệp and Kohayakawa, Yoshiharu and Person, Yury
  • Powers of hamilton cycles in pseudorandom graphs. Allen, Peter and Böttcher, Julia and Hàn, Hiệp and Kohayakawa, Yoshiharu and Person, Yury
  • Proof of the bandwidth conjecture of Bollobás and Komlós. Böttcher, Julia and Schacht, Mathais and Taraz, Anusch
  • Properly coloured copies and rainbow copies of large graphs with small maximum degree. Böttcher, Julia and Kohayakawa, Yoshiharu and Procacci, Aldo
  • Ramsey properties of permutations. Böttcher, Julia and Foniok, Jan
  • Regular slices for hypergraphs. Allen, Peter and Böttcher, Julia and Cooley, Oliver and Mycroft, Richard
  • Regularity inheritance in pseudorandom graphs. Allen, Peter and Böttcher, Julia and Skokan, Jozef and Stein, Maya picture_as_pdf
  • Spanning 3-colourable subgraphs of small bandwidth in dense graphs. Böttcher, Julia and Schacht, Mathias and Taraz, Anusch
  • Spanning embeddings of arrangeable graphs with sublinear bandwidth. Böttcher, Julia and Taraz, Anusch and Würfl, Andreas
  • Tight Hamilton cycles in random hypergraphs. Allen, Peter and Böttcher, Julia and Kohayakawa, Yoshiharu and Person, Yury
  • Tight cycles and regular slices in dense hypergraphs. Allen, Peter and Böttcher, Julia and Cooley, Oliver and Mycroft, Richard
  • Triangle-free subgraphs of random graphs. Allen, Peter and Böttcher, Julia and Kohayakawa, Yoshiharu and Roberts, Barnaby
  • Triangles in randomly perturbed graphs. Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amedeo and Skokan, Jozef picture_as_pdf
  • Universality for bounded degree spanning trees in randomly perturbed graphs. Böttcher, Julia and Han, Jie and Kohayakawa, Yoshiharu and Montgomery, Richard and Parczyk, Olaf and Person, Yury picture_as_pdf
  • An approximate blow-up lemma for sparse hypergraphs. Allen, Peter and Böttcher, Julia and Hng, Eng Keat and Skokan, Jozef and Davies, Ewan picture_as_pdf
  • An approximate blow-up lemma for sparse pseudorandom graphs. Allen, Peter and Böttcher, Julia and Hàn, Hiệp and Kohayakawa, Yoshiharu and Person, Yury
  • An approximate version of the tree packing conjecture. Böttcher, Julia and Hladký, Jan and Piguet, Diana and Taraz, Anusch
  • The bandwidth theorem in sparse graphs. Allen, Peter and Böttcher, Julia and Ehrenmüller, Julia and Taraz, Anusch picture_as_pdf
  • The chromatic threshold of graphs. Allen, Peter and Böttcher, Julia and Griffiths, Simon and Kohayakawa, Yoshiharu
  • A density Corrádi-Hajnal theorem. Allen, Peter and Böttcher, Julia and Hladký, Jan and Piguet, Diana
  • An extension of Turán's theorem, uniqueness and stability. Allen, Peter and Böttcher, Julia and Hladký, Jan and Piguet, Diana
  • An extension of the blow-up lemma to arrangeable graphs. Böttcher, Julia and Kohayakawa, Yoshiharu and Taraz, Anusch and Würfl, Andreas
  • An improved error term for minimum H-decompositions of graphs. Allen, Peter and Böttcher, Julia and Person, Yury
  • A robust Corrádi–Hajnal theorem. Allen, Peter and Böttcher, Julia and Corsten, Jan and Davies, Ewan and Jenssen, Matthew and Morris, Patrick and Roberts, Barnaby and Skokan, Jozef picture_as_pdf
  • A spanning bandwidth theorem in random graphs. Allen, Peter and Böttcher, Julia and Ehrenmüller, Julia and Schnitzer, Jakob and Taraz, Anusch picture_as_pdf
  • The square of a Hamilton cycle in randomly perturbed graphs. Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amedeo and Skokan, Jozef picture_as_pdf
  • The tripartite Ramsey number for trees. Böttcher, Julia and Hladký, Jan and Piguet, Diana
    • Chapter
  • Coloring sparse random k-colorable graphs in polynomial expected time. Böttcher, Julia
  • Graph and hypergraph packing. Böttcher, Julia picture_as_pdf
  • Large-scale structures in random graphs. Böttcher, Julia
  • On the bandwidth conjecture for 3-colourable graphs. Böttcher, Julia and Schacht, Mathais and Taraz, Anusch
  • The square of a Hamilton cycle in randomly perturbed graphs. Böttcher, Julia and Parczyk, Olaf and Sgueglia, Amedeo and Skokan, Jozef picture_as_pdf
    • Conference or Workshop Item
  • Local resilience of spanning subgraphs in sparse random graphs. Allen, Peter and Böttcher, Julia and Ehrenmüller, Julia and Taraz, Anusch
  • Tight cycles in hypergraphs. Allen, Peter and Böttcher, Julia and Cooley, Oliver and Mycroft, Richard
  • Triangle-free subgraphs of random graphs. Allen, Peter and Böttcher, Julia and Roberts, Barnaby and Kohayakawa, Yoshiharu
    • Online resource
  • Report of the large-scale Structures in random graphs workshop. Allen, Peter and Böttcher, Julia and Skokan, Jozef
  • vvv. Böttcher, Julia