Julia Böttcher

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 23

Top Topics

Bounded Treewidth

Top Venues

Electron. Notes Discret. Math.

Random Struct. Algorithms

Comb. Probab. Comput.

Publications

Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein
Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles. Eur. J. Comb. 121 (2024)
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
Triangles in randomly perturbed graphs. Comb. Probab. Comput. 32 (1) (2023)
Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz
A spanning bandwidth theorem in random graphs. Comb. Probab. Comput. 31 (4) (2022)
Jon Leefmann, Julia Böttcher, Michael Jungert, Christoph Merdes, Sebastian Schuol
Editorial: Public research and private knowledge - Science in times of diverse research funding. Frontiers Res. Metrics Anal. 7 (2022)
Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan
Cycle factors in randomly perturbed graphs. LAGOS (2021)
Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies
An Approximate Blow-up Lemma for Sparse Hypergraphs. LAGOS (2021)
Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein
Regularity inheritance in pseudorandom graphs. Random Struct. Algorithms 56 (2) (2020)
Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person
Universality for bounded degree spanning trees in randomly perturbed graphs. Random Struct. Algorithms 55 (4) (2019)
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Barnaby Roberts
Triangle-Free Subgraphs of Random Graphs. Comb. Probab. Comput. 27 (2) (2018)
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
Tight cycles and regular slices in dense hypergraphs. J. Comb. Theory, Ser. A 149 (2017)
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
Packing degenerate graphs greedily. Electron. Notes Discret. Math. 61 (2017)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton cycles in pseudorandom graphs. Comb. 37 (4) (2017)
Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
Chromatic thresholds in sparse random graphs. Random Struct. Algorithms 51 (2) (2017)
Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person
Embedding spanning bounded degree subgraphs in randomly perturbed graphs. Electron. Notes Discret. Math. 61 (2017)
Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris
Chromatic thresholds in dense random graphs. Random Struct. Algorithms 51 (2) (2017)
Julia Böttcher
Large-scale structures in random graphs. BCC (2017)
Julia Böttcher, Anusch Taraz, Andreas Würfl
Spanning embeddings of arrangeable graphs with sublinear bandwidth. Random Struct. Algorithms 48 (2) (2016)
Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa
Triangle-Free Subgraphs of Random Graphs. Electron. Notes Discret. Math. 49 (2015)
Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz
Local resilience of spanning subgraphs in sparse random graphs. Electron. Notes Discret. Math. 49 (2015)
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
Tight Cycles in Hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl
An Extension of the Blow-up Lemma to Arrangeable Graphs. SIAM J. Discret. Math. 29 (2) (2015)
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person
Tight Hamilton cycles in random hypergraphs. Random Struct. Algorithms 46 (3) (2015)
Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft
Regular slices for hypergraphs. Electron. Notes Discret. Math. 49 (2015)
Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz
An Approximate Version of the Tree Packing Conjecture via Random Embeddings. APPROX-RANDOM (2014)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
Powers of Hamilton Cycles in Pseudorandom Graphs. LATIN (2014)
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
An Extension of Turán's Theorem, Uniqueness and Stability. Electron. J. Comb. 21 (4) (2014)
Peter Allen, Julia Böttcher, Yury Person
An improved error term for minimum H-decompositions of graphs. J. Comb. Theory, Ser. B 108 (2014)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
Almost Spanning Subgraphs of Random Graphs After Adversarial Edge Removal. Comb. Probab. Comput. 22 (5) (2013)
Julia Böttcher, Jan Foniok
Ramsey Properties of Permutations. Electron. J. Comb. 20 (1) (2013)
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
Turánnical hypergraphs. Random Struct. Algorithms 42 (1) (2013)
Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person
An approximate blow-up lemma for sparse pseudorandom graphs. Electron. Notes Discret. Math. 44 (2013)
Julia Böttcher, Jan Hladký, Diana Piguet
The tripartite Ramsey number for trees. J. Graph Theory 69 (3) (2012)
Julia Böttcher, Anusch Taraz, Andreas Würfl
Perfect Graphs of Fixed Density: Counting and Homogeneous Sets. Comb. Probab. Comput. 21 (5) (2012)
Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci
Properly coloured copies and rainbow copies of large graphs with small maximum degree. Random Struct. Algorithms 40 (4) (2012)
Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet
A density Corrádi-Hajnal theorem. Electron. Notes Discret. Math. 38 (2011)
Peter Allen, Julia Böttcher, Jan Hladký
Filling the gap between Turán's theorem and Pósa's conjecture. J. Lond. Math. Soc. 84 (2) (2011)
Julia Böttcher, Anusch Taraz, Andreas Würfl
-free graphs of fixed density: counting and homogeneous sets. Electron. Notes Discret. Math. 38 (2011)
Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs. Eur. J. Comb. 31 (5) (2010)
Julia Böttcher, Peter Heinig, Anusch Taraz
Embedding into Bipartite Graphs. SIAM J. Discret. Math. 24 (4) (2010)
Julia Böttcher, Sybille Müller
Forcing spanning subgraphs via Ore type conditions. Electron. Notes Discret. Math. 34 (2009)
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz
Almost spanning subgraphs of random graphs after adversarial edge removal. Electron. Notes Discret. Math. 35 (2009)
Julia Böttcher, Jan Hladký, Diana Piguet
The tripartite Ramsey number for trees. Electron. Notes Discret. Math. 34 (2009)
Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley
Minimum degree conditions for large subgraphs. Electron. Notes Discret. Math. 34 (2009)
Julia Böttcher, Mathias Schacht, Anusch Taraz
Spanning 3-colourable subgraphs of small bandwidth in dense graphs. J. Comb. Theory, Ser. B 98 (4) (2008)
Julia Böttcher, Dan Vilenchik
On the tractability of coloring semirandom graphs. Inf. Process. Lett. 108 (3) (2008)
Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl
Bandwidth, treewidth, separators, expansion, and universality. Electron. Notes Discret. Math. 31 (2008)
Julia Böttcher, Mathias Schacht, Anusch Taraz
Embedding spanning subgraphs of small bandwidth. Electron. Notes Discret. Math. 29 (2007)
Julia Böttcher, Mathias Schacht, Anusch Taraz
On the bandwidth conjecture for 3-colourable graphs. SODA (2007)
Julia Böttcher
-Colorable Graphs in Polynomial Expected Time. MFCS (2005)