Julia Böttcher

According to our database1, Julia Böttcher authored at least 38 papers between 2005 and 2020.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Regularity inheritance in pseudorandom graphs.
Random Struct. Algorithms, 2020

2019
Universality for bounded degree spanning trees in randomly perturbed graphs.
Random Struct. Algorithms, 2019

2017
Chromatic thresholds in sparse random graphs.
Random Struct. Algorithms, 2017

Chromatic thresholds in dense random graphs.
Random Struct. Algorithms, 2017

Tight cycles and regular slices in dense hypergraphs.
J. Comb. Theory, Ser. A, 2017

Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Electron. Notes Discret. Math., 2017

Packing degenerate graphs greedily.
Electron. Notes Discret. Math., 2017

Powers of Hamilton cycles in pseudorandom graphs.
Comb., 2017

2016
Spanning embeddings of arrangeable graphs with sublinear bandwidth.
Random Struct. Algorithms, 2016

2015
An Extension of the Blow-up Lemma to Arrangeable Graphs.
SIAM J. Discret. Math., 2015

Tight Hamilton cycles in random hypergraphs.
Random Struct. Algorithms, 2015

Triangle-Free Subgraphs of Random Graphs.
Electron. Notes Discret. Math., 2015

Local resilience of spanning subgraphs in sparse random graphs.
Electron. Notes Discret. Math., 2015

Regular slices for hypergraphs.
Electron. Notes Discret. Math., 2015

Tight Cycles in Hypergraphs.
Electron. Notes Discret. Math., 2015

2014
An improved error term for minimum H-decompositions of graphs.
J. Comb. Theory, Ser. B, 2014

An Extension of Turán's Theorem, Uniqueness and Stability.
Electron. J. Comb., 2014

An Approximate Version of the Tree Packing Conjecture via Random Embeddings.
Proceedings of the Approximation, 2014

2013
Turánnical hypergraphs.
Random Struct. Algorithms, 2013

An approximate blow-up lemma for sparse pseudorandom graphs.
Electron. Notes Discret. Math., 2013

Ramsey Properties of Permutations.
Electron. J. Comb., 2013

2012
Properly coloured copies and rainbow copies of large graphs with small maximum degree.
Random Struct. Algorithms, 2012

Perfect Graphs of Fixed Density: Counting and Homogeneous Sets.
Comb. Probab. Comput., 2012

2011
Filling the gap between Turán's theorem and Pósa's conjecture.
J. Lond. Math. Soc., 2011

Induced C<sub>5</sub>-free graphs of fixed density: counting and homogeneous sets.
Electron. Notes Discret. Math., 2011

A density Corrádi-Hajnal theorem.
Electron. Notes Discret. Math., 2011

2010
Embedding into Bipartite Graphs.
SIAM J. Discret. Math., 2010

Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
Eur. J. Comb., 2010

2009
Forcing spanning subgraphs via Ore type conditions.
Electron. Notes Discret. Math., 2009

Almost spanning subgraphs of random graphs after adversarial edge removal.
Electron. Notes Discret. Math., 2009

The tripartite Ramsey number for trees.
Electron. Notes Discret. Math., 2009

Minimum degree conditions for large subgraphs.
Electron. Notes Discret. Math., 2009

2008
Spanning 3-colourable subgraphs of small bandwidth in dense graphs.
J. Comb. Theory, Ser. B, 2008

On the tractability of coloring semirandom graphs.
Inf. Process. Lett., 2008

Bandwidth, treewidth, separators, expansion, and universality.
Electron. Notes Discret. Math., 2008

2007
Embedding spanning subgraphs of small bandwidth.
Electron. Notes Discret. Math., 2007

On the bandwidth conjecture for 3-colourable graphs.
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.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005


  Loading...