Böttcher, Julia
451  results:
Search for persons X
?
1

Partitioning a 2-edge-coloured graph of minimum degree 2n/3..:

Allen, Peter ; Böttcher, Julia ; Lang, Richard..
European Journal of Combinatorics.  121 (2024)  - p. 103838 , 2024
 
?
2

A robust Corrádi–Hajnal theorem:

Allen, Peter ; Böttcher, Julia ; Corsten, Jan...
Random Structures & Algorithms.  65 (2024)  1 - p. 61-130 , 2024
 
?
 
?
4

Triangles in randomly perturbed graphs:

Böttcher, Julia ; Parczyk, Olaf ; Sgueglia, Amedeo.
Combinatorics, Probability and Computing.  32 (2022)  1 - p. 91-121 , 2022
 
?
 
?
 
?
7

A spanning bandwidth theorem in random graphs:

Allen, Peter ; Böttcher, Julia ; Ehrenmüller, Julia..
Combinatorics, Probability and Computing.  31 (2021)  4 - p. 598-628 , 2021
 
?
8

Cycle factors in randomly perturbed graphs:

Böttcher, Julia ; Parczyk, Olaf ; Sgueglia, Amedeo.
Procedia Computer Science.  195 (2021)  - p. 404-411 , 2021
 
?
9

The Square of a Hamilton Cycle in Randomly Perturbed Graphs:

, In: Trends in Mathematics; Extended Abstracts EuroComb 2021,
 
?
10

An Approximate Blow-up Lemma for Sparse Hypergraphs:

Allen, Peter ; Böttcher, Julia ; Hng, Eng Keat..
Procedia Computer Science.  195 (2021)  - p. 394-403 , 2021
 
?
12

Regularity inheritance in pseudorandom graphs:

Allen, Peter ; Böttcher, Julia ; Skokan, Jozef.
Random Structures & Algorithms.  56 (2019)  2 - p. 306-338 , 2019
 
?
 
?
14

Packing degenerate graphs:

Allen, Peter ; Böttcher, Julia ; Hladký, Jan.
Advances in Mathematics.  354 (2019)  - p. 106739 , 2019
 
1-15