220 citations · 724 across the 45 of their papers we have counts for
4 papers · 1 filter
A proof of the Erdős-Faber-Lovász conjecture
Dong Yeap Kang, Tom Kelly, Daniela Kühn +2
The Erdős-Faber-Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on vertices is at most . In this paper, we prove this conjecture f…
Resolution of the Oberwolfach problem
Stefan Glock, Felix Joos, Jaehoon Kim +2
The Oberwolfach problem, posed by Ringel in 1967, asks for a decomposition of into edge-disjoint copies of a given -factor. We show that this can be achieved for all…
On a conjecture of Erdős on locally sparse Steiner triple systems
Stefan Glock, Daniela Kühn, Allan Lo +1
A famous theorem of Kirkman says that there exists a Steiner triple system of order if and only if . In 1973, Erdős conjectured that one can find so-called…
Embedding large subgraphs into dense graphs
Daniela Kühn, Deryk Osthus
What conditions ensure that a graph G contains some given spanning subgraph H? The most famous examples of results of this kind are probably Dirac's theorem on Hamilton cycles and…