Julia Böttcher

According to our database, Julia Böttcher authored at least 45 papers between 2005 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Partitioning a 2-edge-coloured graph of minimum degree 2n/3+o(n) into three monochromatic cycles.

Peter Allen, Julia Böttcher, Richard Lang, Jozef Skokan, Maya Stein

Eur. J. Comb., 2024

2023

Triangles in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Comb. Probab. Comput., January, 2023

2022

Editorial: Public research and private knowledge - Science in times of diverse research funding.

Jon Leefmann, Julia Böttcher, Michael Jungert, Christoph Merdes, Sebastian Schuol

Frontiers Res. Metrics Anal., 2022

A spanning bandwidth theorem in random graphs.

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Jakob Schnitzer, Anusch Taraz

Comb. Probab. Comput., 2022

2021

Cycle factors in randomly perturbed graphs.

Julia Böttcher, Olaf Parczyk, Amedeo Sgueglia, Jozef Skokan

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

An Approximate Blow-up Lemma for Sparse Hypergraphs.

Peter Allen, Julia Böttcher, Eng Keat Hng, Jozef Skokan, Ewan Davies

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

2020

Regularity inheritance in pseudorandom graphs.

Peter Allen, Julia Böttcher, Jozef Skokan, Maya Stein

Random Struct. Algorithms, 2020

2019

Universality for bounded degree spanning trees in randomly perturbed graphs.

Julia Böttcher, Jie Han, Yoshiharu Kohayakawa, Richard Montgomery, Olaf Parczyk, Yury Person

Random Struct. Algorithms, 2019

2017

Chromatic thresholds in sparse random graphs.

Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris

Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.

Peter Allen, Julia Böttcher, Simon Griffiths, Yoshiharu Kohayakawa, Robert Morris

Random Struct. Algorithms, 2017

Tight cycles and regular slices in dense hypergraphs.

Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

J. Comb. Theory A, 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.

Julia Böttcher, Richard Montgomery, Olaf Parczyk, Yury Person

Electron. Notes Discret. Math., 2017

Packing degenerate graphs greedily.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.

Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person

Comb., 2017

Large-scale structures in random graphs.

Julia Böttcher

Proceedings of the Surveys in Combinatorics, 2017

2016

Spanning embeddings of arrangeable graphs with sublinear bandwidth.

Julia Böttcher, Anusch Taraz, Andreas Würfl

Random Struct. Algorithms, 2016

2015

An Extension of the Blow-up Lemma to Arrangeable Graphs.

Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz, Andreas Würfl

SIAM J. Discret. Math., 2015

Tight Hamilton cycles in random hypergraphs.

Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Yury Person

Random Struct. Algorithms, 2015

Triangle-Free Subgraphs of Random Graphs.

Peter Allen, Julia Böttcher, Barnaby Roberts, Yoshiharu Kohayakawa

Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.

Peter Allen, Julia Böttcher, Julia Ehrenmüller, Anusch Taraz

Electron. Notes Discret. Math., 2015

Regular slices for hypergraphs.

Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.

Peter Allen, Julia Böttcher, Oliver Cooley, Richard Mycroft

Electron. Notes Discret. Math., 2015

2014

An improved error term for minimum H-decompositions of graphs.

Peter Allen, Julia Böttcher, Yury Person

J. Comb. Theory B, 2014

An Extension of Turán's Theorem, Uniqueness and Stability.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. J. Comb., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.

Julia Böttcher, Jan Hladký, Diana Piguet, Anusch Taraz

Proceedings of the Approximation, 2014

2013

Turánnical hypergraphs.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Random Struct. Algorithms, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.

Peter Allen, Julia Böttcher, Hiêp Hàn, Yoshiharu Kohayakawa, Yury Person

Electron. Notes Discret. Math., 2013

Ramsey Properties of Permutations.

Julia Böttcher, Jan Foniok

Electron. J. Comb., 2013

2012

Properly coloured copies and rainbow copies of large graphs with small maximum degree.

Julia Böttcher, Yoshiharu Kohayakawa, Aldo Procacci

Random Struct. Algorithms, 2012

The tripartite Ramsey number for trees.

Julia Böttcher, Jan Hladký, Diana Piguet

J. Graph Theory, 2012

Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.

Julia Böttcher, Anusch Taraz, Andreas Würfl

Comb. Probab. Comput., 2012

2011

Filling the gap between Turán's theorem and Pósa's conjecture.

Peter Allen, Julia Böttcher, Jan Hladký

J. Lond. Math. Soc., 2011

Induced C₅-free graphs of fixed density: counting and homogeneous sets.

Julia Böttcher, Anusch Taraz, Andreas Würfl

Electron. Notes Discret. Math., 2011

A density Corrádi-Hajnal theorem.

Peter Allen, Julia Böttcher, Jan Hladký, Diana Piguet

Electron. Notes Discret. Math., 2011

2010

Embedding into Bipartite Graphs.

Julia Böttcher, Peter Heinig, Anusch Taraz

SIAM J. Discret. Math., 2010

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.

Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl

Eur. J. Comb., 2010

2009

Forcing spanning subgraphs via Ore type conditions.

Julia Böttcher, Sybille Müller

Electron. Notes Discret. Math., 2009

Almost spanning subgraphs of random graphs after adversarial edge removal.

Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz

Electron. Notes Discret. Math., 2009

Minimum degree conditions for large subgraphs.

Peter Allen, Julia Böttcher, Jan Hladký, Oliver Cooley

Electron. Notes Discret. Math., 2009

2008

Spanning 3-colourable subgraphs of small bandwidth in dense graphs.

Julia Böttcher, Mathias Schacht, Anusch Taraz

J. Comb. Theory B, 2008

On the tractability of coloring semirandom graphs.

Julia Böttcher, Dan Vilenchik

Inf. Process. Lett., 2008

Bandwidth, treewidth, separators, expansion, and universality.

Julia Böttcher, Klaas Paul Pruessmann, Anusch Taraz, Andreas Würfl

Electron. Notes Discret. Math., 2008

2007

Embedding spanning subgraphs of small bandwidth.

Julia Böttcher, Mathias Schacht, Anusch Taraz

Electron. Notes Discret. Math., 2007

On the bandwidth conjecture for 3-colourable graphs.

Julia Böttcher, Mathias Schacht, Anusch Taraz

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2005

Coloring Sparse Random <i>k</i>-Colorable Graphs in Polynomial Expected Time.

Julia Böttcher

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005