Universality for bounded degree spanning trees in randomly perturbed graphs.
(with
J. Han,
Y. Kohayakawa,
R. Montgomery,
O. Parczyk and
Y. Person),
2018.
[arxiv]
Embedding spanning bounded degree graphs in randomly perturbed graphs.
(with
R. Montgomery,
O. Parczyk and
Y. Person),
2018.
[arxiv]
Making spanning graphs.
(with
P. Allen,
Y. Kohayakawa,
H. Naves and
Y. Person),
2017.
[arxiv]
Packing degenerate graphs.
(with
P. Allen,
J. Hladký and
D. Piguet),
2017.
[arxiv]
Blow-up lemmas for sparse graphs.
(with
P. Allen,
H. Hàn,
Y. Kohayakawa and
Y. Person),
2017.
[arxiv]
The bandwidth theorem in sparse random graphs.
(with
P. Allen,
J. Ehrenmüller and
A. Taraz),
2017.
[arxiv]
Regularity inheritance in pseudorandom graphs.
(with
P. Allen,
J. Skokan and
M. Stein),
2016.
[arxiv]
Journal publications
Triangle-free subgraphs of random graphs.
(with
P. Allen,
Y. Kohayakawa and
B. Roberts),
Combinatorics, Probability and Computing, published online.
[arxiv]
Large-scale structures in random graphs.
In Surveys in Combinatorics 2017, London Mathematical Society Lecture Note Series, 87-140.
[arxiv]
Chromatic thresholds in sparse random graphs.
(with
P. Allen,
S. Griffiths,
Y. Kohayakawa and
R. Morris),
Random Structures and Algorithms 51, 215-236, 2017.
[arxiv]
Chromatic thresholds in dense random graphs.
(with
P. Allen,
S. Griffiths,
Y. Kohayakawa and
R. Morris),
Random Structures and Algorithms 51, 185-214, 2017.
[arxiv]
Powers of Hamilton cycles in pseudorandom graphs.
(with
P. Allen,
H. Hàn,
Y. Kohayakawa and
Y. Person),
Combinatorica 37, 573-616, 2017.
[arxiv]
Tight cycles and regular slices in dense hypergraphs.
(with
P. Allen,
O. Cooley and
R. Mycroft),
Journal of Combinatorial Theory Series A
149, 30-100, 2017.
[arxiv]
An approximate version of the tree packing conjecture.
(with
J. Hladký,
D. Piguet
and
A. Taraz),
Israel Journal of Mathematics 211(1), 391-446, 2016
[arxiv]
An Extension of the Blow-up Lemma to arrangeable graphs. (with
Y. Kohayakawa,
A. Taraz and
A. Würfl),
SIAM Journal on Discrete Mathematics 29(2), 962-1001, 2015.
[pdf]
A density Corrádi-Hajnal Theorem.
(with
P. Allen,
J. Hladký and
D. Piguet),
Canadian Journal of Mathematics 67, 721-758, 2015.
[arxiv]
Spanning embeddings of arrangeable graphs with sublinear bandwidth. (with
A. Taraz and
A. Würfl),
Random Structures and Algorithms 48(2), 270-289, 2015.
[pdf]
Tight Hamilton cycles in random hypergraphs.
(with
P. Allen,
Y. Kohayakawa and
Y. Person),
Random Structures and Algorithms 46(3), 446-465, 2015.
[pdf]
An extension of Turán's theorem, uniqueness and stability.
(with
P. Allen,
J. Hladký and
D. Piguet),
Electronic Journal of Combinatorics 21(4), P4.5, 10pp, 2014.
[arxiv]
An improved error term for minimum H-decompositions of graphs.
(with
P. Allen and
Y. Person),
Journal of Combinatorial Theory Series B 108, 92-101, 2014.
[pdf]
Almost spanning subgraphs of random graphs
after adversarial edge removal. (with
Y. Kohayakawa and
A. Taraz),
Combinatorics, Probability and Computing 22, 639-683, 2013.
[arxiv]
The chromatic thresholds of graphs.
(with
P. Allen,
S. Griffiths,
Y. Kohayakawa and
R. Morris),
Advances in Mathematics 235, 261-295, 2013.
[pdf]
[ps]
Ramsey properties of permutations.
(with
J. Foniok),
Electronic Journal of Combinatorics 20(1), P2, 10 pp, 2013.
[pdf]
[ps]
Turánnical hypergraphs.
(with
P. Allen,
J. HladkýD. Piguet),
Random Structures and Algorithms 42(1), 29-58, 2013.
[pdf]
[ps]
Perfect graphs of fixed density: counting and homogeneous sets.
(with
A. Taraz and
A. Würfl),
Combinatorics, Probability and Computing 21(5), 661-682, 2012.
[pdf]
[ps]
Properly coloured copies and rainbow copies of large graphs with small
maximum degree.
(with
Y. Kohayakawa and
A. Procacci)
Random Structures and Algorithms 40(4), 425-436, 2012.
[pdf]
[ps]
The tripartite Ramsey number for
trees.
(with
J. Hladký and
D. Piguet)
Journal of Graph Theory 69(3), 264-300, 2012.
[pdf] [ps]
Filling the gap between between Turán's
theorem and Pósa's conjecture.
(with
P. Allen and
J. Hladký)
Journal of the London Mathematical Society 84(2), 269-302, 2011
[pdf]
[ps]
Embedding in bipartite graphs.
(with
P. Heinig and
A. Taraz)
SIAM Journal on Discrete Mathematics, 24(4), 1215-1233, 2010.
[pdf]
[ps]
Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs.
(with
K. Pruessmann,
A. Taraz and
A. Würfl)
European Journal of Combinatorics 31(5), 1217-1227, 2010.
[pdf]
[ps]
Proof of the bandwidth conjecture of Bollobás
and Komlós.
(with
M. Schacht and
A. Taraz)
Mathematische Annalen 343(1), 175-205, 2009.
[pdf]
[ps]
On the tractability of coloring semirandom
graphs
(with
D. Vilenchik)
Information Processing Letters
108(3), 143-149, 2008. [pdf] [ps]
Spanning 3-colourable subgraphs of small
bandwidth in dense graphs.
(with
M. Schacht and
A. Taraz)
Journal of Combinatorial Theory Series B 98(4),
752-777, 2008. [pdf] [ps]
Conference proceedings (refereed)
Embedding spanning bounded degree subgraphs in randomly perturbed graphs.
Extended Abstract.
(with
R. Montgomery,
O. Parczyk and
Y. Person)
In
Electronic Notes on Discrete Mathematics 61 (EuroComb,
Vienna), 155-161, 2017.
Packing degenerate graphs greedily.
Extended Abstract.
(with
P. Allen,
Hladký and
D. Piguet)
In
Electronic Notes on Discrete Mathematics 61 (EuroComb,
Vienna), 45-51, 2017.
Triangle Free Subgraphs of Random Graphs.
Extended Abstract.
(with
P. Allen,
Y. Kohayakawa and
B. Roberts)
In
Electronic Notes on Discrete Mathematics 49 (EuroComb,
Bergen), 393-397, 2015.
Local resilience of spanning subgraphs in sparse random graphs
Extended Abstract.
(with
P. Allen,
J. Ehrenmüller and
A. Taraz)
In
Electronic Notes on Discrete Mathematics 49 (EuroComb,
Bergen), 513-521, 2015.
Regular slices for hypergraphs
Extended Abstract.
(with
P. Allen,
O. Cooley and
R. Mycroft)
In
Electronic Notes on Discrete Mathematics 49 (EuroComb,
Bergen), 691-698, 2015.
Tight cycles in hypergraphs.
Extended Abstract.
(with
P. Allen,
O. Cooley and
R. Mycroft)
In
Electronic Notes on Discrete Mathematics 49 (EuroComb,
Bergen), 675-682, 2015.
An approximate version of the tree packing conjecture.
Extended Abstract.
(with
J. Hladký,
D. Piguet and
A. Taraz
)
Leibniz International Proceedings in Informatics (APPROX/RANDOM,
Barcelona), 490-499, 2014.
Powers of Hamilton cycles in pseudorandom graphs.
Extended Abstract.
(with
P. Allen,
Y. Kohayakawa,
Y. Person and
H. Hán),
Lecture Notes in Computer Science 8392 (LATIN, Montevideo), 355-366, 2014.
An approximate blow-up lemma for sparse pseudorandom graphs.
Extended Abstract.
(with
P. Allen,
Y. Kohayakawa,
Y. Person and
H. Hán),
Electronic Notes on Discrete Mathematics 44 (LAGOS, Quintana
Roo), 393-398, 2013.
[pdf]
Induced C_5-free graphs of fixed density: counting and homogeneous sets.
Extended Abstract.
(with
A. Taraz and
A. Würfl)
In
Electronic Notes on Discrete Mathematics 38 (EuroComb,
Budapest), 181-186, 2011.
[pdf]
A density Corradi-Hajnal theorem
Extended Abstract.
(with
P. Allen,
J. Hladký
and
D. Piguet)
In
Electronic Notes on Discrete Mathematics 38 (EuroComb,
Budapest), 31-36, 2011.
[pdf]
Almost spanning subgraphs of random graphs after adversarial edge removal.
Extended Abstract.
(with
Y. Kohayakawa
and
A. Taraz) In
Electronic Notes on Discrete Mathematics (LAGOS, Gramado), 35, 335-340, 2009.
[pdf]
[ps]
Minimum degree conditions for large subgraphs.
Extended Abstract.
(with
P. Allen,
O. Cooley, and
J. Hladký) In
Electronic Notes on Discrete Mathematics 34 (EuroComb, Bordeaux), 75-79, 2009.
[pdf]
Forcing spanning subgraphs via Ore type conditions.
Extended Abstract.
(with
S. Müller) In
Electronic Notes on Discrete Mathematics 34 (EuroComb, Bordeaux), 255-259, 2009.
[pdf]
The tripartite Ramsey number for trees.
Extended Abstract.
(with
J. Hladký
and
D. Piguet) In
Electronic Notes on Discrete Mathematics 34 (EuroComb, Bordeaux), 597-601, 2009.
[pdf]
Bandwidth, treewidth, separators, expansion, and
universality.
Extended Abstract.
(with
K. Pruessmann,
A. Taraz
and
A. Würfl)
In
Electronic Notes on Discrete Mathematics 31 (CGGT, Paris), 91-96, 2008.
[pdf]
[ps]
Embedding spanning subgraphs of small
bandwidth. Extended Abstract.
(with
M. Schacht and
A. Taraz)
In Electronic Notes on Discrete
Mathematics 29 (EuroComb, Sevilla), 485-489, 2007. [pdf] [ps]
On the bandwidth conjecture for 3-colourable graphs. Extended Abstract.
(with
M. Schacht and
A. Taraz)
In "Proceedings of the ACM-SIAM Symposium
on Discrete Algorithms (SODA)", 618-626, 2007. [pdf] [ps]
Coloring sparse random k-colorable graphs in
polynomial expected time. In "Proceedings of the
30th International Symposium, MFCS 2005", 156-167, 2005. [pdf][ps]
Theses
Embedding large graphs - The
Bollobás-Komlós conjecture and beyond. Doktorarbeit, Technische Universität München, 2009. [pdf] [ps]
Coloring sparse random k-colorable graphs
in polynomial expected time. Diplomarbeit,
Humboldt-Universität zu Berlin, 2005. [pdf] [ps]
Julia Böttcher
Last modified: Wed Apr 11 14:15:48 CEST 2018