The following pages link to Julia Böttcher (Q273107):
Displaying 37 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Triangle-free subgraphs of random graphs (Q322274) (← links)
- Local resilience of spanning subgraphs in sparse random graphs (Q322312) (← links)
- Tight cycles in hypergraphs (Q322350) (← links)
- Regular slices for hypergraphs (Q322353) (← links)
- An extension of Turán's theorem, uniqueness and stability (Q463041) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Proof of the bandwidth conjecture of Bollobás and Komlós (Q957895) (← links)
- On the tractability of coloring semirandom graphs (Q975431) (← links)
- Bandwidth, expansion, treewidth, separators and universality for bounded-degree graphs (Q976141) (← links)
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs (Q1689904) (← links)
- Ramsey properties of permutations (Q1953372) (← links)
- Spanning embeddings of arrangeable graphs with sublinear bandwidth (Q2795744) (← links)
- Almost spanning subgraphs of random graphs after adversarial edge removal (Q2840559) (← links)
- Minimum degree conditions for large subgraphs (Q2851441) (← links)
- Forcing spanning subgraphs via Ore type conditions (Q2851473) (← links)
- A density Corrádi-Hajnal theorem (Q2857315) (← links)
- Induced \(C_5\)-free graphs of fixed density: counting and homogeneous sets (Q2857341) (← links)
- Properly coloured copies and rainbow copies of large graphs with small maximum degree (Q2904592) (← links)
- Perfect graphs of fixed density: counting and homogeneous sets (Q2911067) (← links)
- (Q2934645) (← links)
- An Approximate Version of the Tree Packing Conjecture via Random Embeddings (Q2969640) (← links)
- Embedding into Bipartite Graphs (Q3013126) (← links)
- Embedding spanning subgraphs of small bandwidth (Q3503507) (← links)
- EMBEDDING SPANNING BOUNDED DEGREE GRAPHS IN RANDOMLY PERTURBED GRAPHS (Q5112840) (← links)
- Universality for bounded degree spanning trees in randomly perturbed graphs (Q5216180) (← links)
- Large-scale structures in random graphs (Q5234219) (← links)
- An Extension of the Blow-up Lemma to Arrangeable Graphs (Q5254090) (← links)
- Bandwidth, treewidth, separators, expansion, and universality (Q5300988) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492855) (← links)
- Triangles in randomly perturbed graphs (Q5885187) (← links)
- The tripartite Ramsey number for trees (Q5891229) (← links)
- Graph and hypergraph packing (Q6198635) (← links)
- The square of a Hamilton cycle in randomly perturbed graphs (Q6505445) (← links)
- The square of a Hamilton cycle in randomly perturbed graphs (Q6596386) (← links)
- Partitioning a 2-edge-coloured graph of minimum degree \(2n/3 + o(n)\) into three monochromatic cycles (Q6612514) (← links)
- A robust Corrádi-Hajnal theorem (Q6641058) (← links)
