Allen, Peter and
Böttcher, Julia and
Griffiths, Simon and
Kohayakawa, Yoshiharu and
Morris, Robert
(2016)
Chromatic thresholds in sparse random graphs
Random Structures & Algorithms. ISSN 1098-2418
Allen, Peter and
Böttcher, Julia and
Kohayakawa, Yoshiharu and
Roberts, Barnaby
(2016)
Triangle-free subgraphs of random graphs
Combinatorics, Probability and Computing. ISSN 0963-5483
Allen, Peter and
Böttcher, Julia and
Griffiths, Simon and
Kohayakawa, Yoshiharu and
Morris, Robert
(2016)
Chromatic thresholds in dense random graphs
Random Structures & Algorithms. ISSN 1098-2418
Allen, Peter and
Böttcher, Julia and
Cooley, Oliver and
Mycroft, Richard
(2016)
Tight cycles and regular slices in dense hypergraphs
Journal of Combinatorial Theory, Series A. ISSN 0097-3165
Allen, Peter and
Böttcher, Julia and
Cooley, Oliver and
Mycroft, Richard
(2015)
Regular slices for hypergraphs
Electronic Notes in Discrete Mathematics, 49. 691-698. ISSN 1571-0653
Allen, Peter and
Böttcher, Julia and
Roberts, Barnaby and
Kohayakawa, Yoshiharu
(2015)
Triangle-free subgraphs of random graphs.
In: European Conference on Combinatorics, Graph Theory and Applications, 31 Aug - 04 Sep, Bergen, Norway
Allen, Peter and
Böttcher, Julia and
Hladký, Jan and
Piguet, Diana
(2015)
A density Corrádi-Hajnal theorem
Canadian Journal of Mathematics, 67 (4). 721-758. ISSN 0008-414X
Allen, Peter and
Böttcher, Julia and
Kohayakawa, Yoshiharu and
Person, Yury
(2015)
Tight Hamilton cycles in random hypergraphs
Random Structures and Algorithms, 46 (3). 446-465. ISSN 1042-9832
Allen, Peter and
Böttcher, Julia and
Cooley, Oliver and
Mycroft, Richard
(2015)
Tight cycles in hypergraphs.
In: European Conference on Combinatorics, Graph Theory and Applications, 31 Aug - 04 Sep, Bergen, Norway
Allen, Peter and
Böttcher, Julia and
Ehrenmüller, Julia and
Taraz, Anusch
(2015)
Local resilience of spanning subgraphs in sparse random graphs.
In: European Conference on Combinatorics, Graph Theory and Applications, 31 Aug - 04 Sep, Bergen, Norway
Böttcher, Julia and
Taraz, Anusch and
Würfl, Andreas
(2015)
Spanning embeddings of arrangeable graphs with sublinear bandwidth
Random Structures and Algorithms, 48 (2). 270-289. ISSN 1042-9832
Allen, Peter and
Böttcher, Julia and
Hàn, Hiệp and
Kohayakawa, Yoshiharu and
Person, Yury
(2015)
Powers of Hamilton cycles in pseudorandom graphs
Combinatorica. ISSN 1439-6912
Allen, Peter and
Böttcher, Julia and
Person, Yury
(2014)
An improved error term for minimum H-decompositions of graphs
Journal of Combinatorial Theory, Series B, 108. 92-101. ISSN 0095-8956
Allen, Peter and
Böttcher, Julia and
Hàn, Hiệp and
Kohayakawa, Yoshiharu and
Person, Yury
(2014)
Powers of hamilton cycles in pseudorandom graphs
LATIN 2014: Theoretical Informatics, 8392 (30). 355-366. ISSN 16113349
Allen, Peter and
Böttcher, Julia and
Hàn, Hiệp and
Kohayakawa, Yoshiharu and
Person, Yury
(2013)
An approximate blow-up lemma for sparse pseudorandom graphs
Electronic Notes in Discrete Mathematics, 44. 393-398. ISSN 1571-0653
Böttcher, Julia and
Kohayakawa, Yoshiharu and
Taraz, Anusch
(2013)
Almost spanning subgraphs of random graphs after adversarial edge removal
Combinatorics, Probability and Computing, 22 (5). 639-683. ISSN 0963-5483
Allen, Peter and
Böttcher, Julia and
Griffiths, Simon and
Kohayakawa, Yoshiharu
(2013)
The chromatic threshold of graphs
Advances in Mathematics, 235. 261-295. ISSN 0001-8708
Böttcher, Julia and
Kohayakawa, Yoshiharu and
Procacci, Aldo
(2011)
Properly coloured copies and rainbow copies of large graphs with small maximum degree
Random Structures and Algorithms, 40 (4). 425-436. ISSN 1042-9832
Böttcher, Julia and
Heinig, Peter and
Taraz, Anusch
(2010)
Embedding into bipartite graphs
SIAM Journal on Discrete Mathematics, 24 (4). 1215-1233. ISSN 0895-4801
Böttcher, Julia and
Schacht , Mathais and
Taraz, Anusch
(2009)
Proof of the bandwidth conjecture of Bollobás and Komlós
Mathematische Annalen, 343 (1). 175-205. ISSN 1432-1807
Böttcher, Julia and
Kohayakawa, Yoshiharu and
Taraz, Anusch
(2009)
Almost spanning subgraphs of random graphs after adversarial edge removal
Electronic Notes in Discrete Mathematics, 35. 335-340. ISSN 1571-0653
Böttcher, Julia and
Müller, Sybille
(2009)
Forcing spanning subgraphs via Ore type conditions
Electronic Notes in Discrete Mathematics, 34. 255-259. ISSN 1571-0653
Allen, Peter and
Böttcher, Julia and
Hladký, Jan and
Cooley, Oliver
(2009)
Minimum degree conditions for large subgraphs
Electronic Notes in Discrete Mathematics, 34. 75-79. ISSN 1571-0653
Böttcher, Julia and
Pruessmann, Klaas P. and
Taraz, Anusch and
Würfl, Andreas
(2008)
Bandwidth, treewidth, separators, expansion, and universality
Electronic Notes in Discrete Mathematics, 31. 91-96. ISSN 1571-0653
Böttcher, Julia and
Vilenchik, Dan
(2008)
On the tractability of coloring semirandom graphs
Information Processing Letters, 108 (3). 143-149. ISSN 0020-0190
Böttcher, Julia and
Schacht , Mathais and
Taraz, Anusch
(2007)
On the bandwidth conjecture for 3-colourable graphs
In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 618-626. ISBN 9780898716245
Böttcher, Julia
(2005)
Coloring sparse random k-colorable graphs in polynomial expected time
In:
Je¸drzejowicz , Joanna and
Szepietowski, Andrzej, (eds.)
Mathematical Foundations of Computer Science 2005: 30th International Symposium, Mfcs 2005, Gdansk, Poland, August 29–september . Lecture notes in computer science (3618). Springer, Berlin, 156-167. ISBN 9783540287025