The following pages link to Daniela Kühn (Q256988):
Displaying 50 items.
- Short cycles in oriented graphs (Q2851491) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q2857428) (← links)
- Matchings in 3-uniform hypergraphs of large minimum vertex degree (Q2857450) (← links)
- Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (Q2922881) (← links)
- The robust component structure of dense regular graphs and applications (Q2940076) (← links)
- Arbitrary Orientations of Hamilton Cycles in Digraphs (Q2944460) (← links)
- A Semiexact Degree Condition for Hamilton Cycles in Digraphs (Q3008005) (← links)
- Minors in random regular graphs (Q3055786) (← links)
- Approximate Hamilton decompositions of random graphs (Q3119046) (← links)
- Finding Hamilton cycles in robustly expanding digraphs (Q3143742) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q3169283) (← links)
- On the Random Greedy $F$-Free Hypergraph Process (Q3178438) (← links)
- Path and cycle decompositions of dense graphs (Q3384033) (← links)
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs (Q3440255) (← links)
- A minimum degree condition forcing a digraph to be k-linked (Q3503449) (← links)
- A Dirac-Type Result on Hamilton Cycles in Oriented Graphs (Q3529511) (← links)
- Linkedness and Ordered Cycles in Digraphs (Q3545906) (← links)
- (Q3576688) (← links)
- (Q3576703) (← links)
- Hamilton decompositions of regular tournaments (Q3577676) (← links)
- Critical chromatic number and the complexity of perfect packings in graphs (Q3581594) (← links)
- An Ore-type Theorem for Perfect Packings in Graphs (Q3583306) (← links)
- An exact minimum degree condition for Hamilton cycles in oriented graphs (Q3600872) (← links)
- Embedding large subgraphs into dense graphs (Q3656239) (← links)
- (Q4408473) (← links)
- Forcing a <i>K<sub>r</sub></i> minor by high external connectivity (Q4537560) (← links)
- Hamilton cycles in graphs and hypergraphs: an extremal perspective (Q4589011) (← links)
- A blow-up lemma for approximate decompositions (Q4633567) (← links)
- Four-cycles in graphs without a given even cycle (Q4667796) (← links)
- Packings in Dense Regular Graphs (Q4680571) (← links)
- A universal planar graph under the minor relation (Q4700532) (← links)
- Minors in graphs of large girth (Q4800396) (← links)
- Large Topological Cliques in Graphs Without a 4-Cycle (Q4813868) (← links)
- Subdivisions of $K_{r+2}$ in Graphs of Average Degree at Least $r+\varepsilon$ and Large but Constant Girth (Q4819248) (← links)
- On Pósa's Conjecture for Random Graphs (Q4899069) (← links)
- Optimal Packings of Hamilton Cycles in Graphs of High Minimum Degree (Q4921569) (← links)
- A bandwidth theorem for approximate decompositions (Q4967769) (← links)
- Dirac’s theorem for random regular graphs (Q4993119) (← links)
- Extremal aspects of graph and hypergraph decomposition problems (Q5051746) (← links)
- Minimalist designs (Q5120741) (← links)
- Rainbow structures in locally bounded colorings of graphs (Q5128755) (← links)
- Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs (Q5210983) (← links)
- Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing (Q5237911) (← links)
- Edge-disjoint Hamilton cycles in random graphs (Q5252256) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- Maximizing Several Cuts Simultaneously (Q5295415) (← links)
- (Q5419947) (← links)
- Proof of the $1$-factorization and Hamilton Decomposition Conjectures (Q5420009) (← links)
- Spanning triangulations in graphs (Q5462389) (← links)
- Matchings in hypergraphs of large minimum degree (Q5469026) (← links)
