Julia Böttcher

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