Tag Archives: Deryk Osthus

To cheer you up in difficult times 17: Amazing! The Erdős-Faber-Lovász conjecture (for large n) was proved by Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus!

Posted on January 14, 2021 by Gil Kalai

Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, and Deryk Osthus have just uploaded a paper to the arXive, A proof of the Erdős-Faber-Lovász conjecture. (I am thankful to Nati Linial and Ryan Alweiss for telling me about it.) … Continue reading →

Posted in Combinatorics, Updates | Tagged , , , , , | 4 Comments

Amazing: Stefan Glock, Daniela Kühn, Allan Lo, and Deryk Osthus give a new proof for Keevash’s Theorem. And more news on designs.

Posted on November 23, 2016 by Gil Kalai

Blogging was slow recently, and I have various half written posts on all sort of interesting things, and plenty of unfulfilled promises. I want to quickly share with you two and a half news items regarding combinatorial designs. As you … Continue reading →

Posted in Combinatorics, Updates | Tagged , , , , , , , , | 6 Comments