The following pages link to Daniela Kühn (Q256988):
Displaying 23 items.
- Improved Bounds for Topological Cliques in Graphs of Large Girth (Q5470817) (← links)
- Counting Hamilton cycles in Dirac hypergraphs (Q5886103) (← links)
- The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 (Q5889065) (← links)
- Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5890900) (← links)
- Edge-decompositions of graphs with high minimum degree (Q5899605) (← links)
- Ramsey numbers of sparse hypergraphs (Q5900066) (← links)
- The order of the largest complete minor in a random graph (Q5900071) (← links)
- Path decompositions of tournaments (Q6075058) (← links)
- Hypergraph regularity and random sampling (Q6076218) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor (Q6135844) (← links)
- New bounds on the size of nearly perfect matchings in almost regular hypergraphs (Q6139785) (← links)
- The existence of designs via iterative absorption: hypergraph $F$-designs for arbitrary $F$ (Q6279975) (← links)
- The minimum degree threshold for perfect graph packings (Q6476936) (← links)
- Perfect matchings in random sparsifications of Dirac hypergraphs (Q6506950) (← links)
- Path decompositions of tournaments (Q6604694) (← links)
- Resilience with respect to Hamiltonicity in random graphs (Q6621180) (← links)
- Resolution of the Oberwolfach problem (Q6621209) (← links)
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
- Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)
- Perfect matchings in random sparsifications of Dirac hypergraphs (Q6662701) (← links)
