Recent Comments
-
Recent Posts
- What is mathematics (or at least, how it feels)
- Alef’s Corner
- To cheer you up in difficult times 22: some mathematical news! (Part 1)
- Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
- Amazing: Feng Pan and Pan Zhang Announced a Way to “Spoof” (Classically Simulate) the Google’s Quantum Supremacy Circuit!
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky’s conjectures
- Nostalgia corner: John Riordan’s referee report of my first paper
- At the Movies III: Picture a Scientist
- At the Movies II: Kobi Mizrahi’s short movie White Eye makes it to the Oscar’s short list.
Top Posts & Pages
- To cheer you up in difficult times 21: Giles Gardam lecture and new result on Kaplansky's conjectures
- Cheerful News in Difficult Times: The Abel Prize is Awarded to László Lovász and Avi Wigderson
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- TYI 30: Expected number of Dice throws
- János Pach: Guth and Katz's Solution of Erdős's Distinct Distances Problem
- What is mathematics (or at least, how it feels)
- Extremal Combinatorics VI: The Frankl-Wilson Theorem
- Amazing: Feng Pan and Pan Zhang Announced a Way to "Spoof" (Classically Simulate) the Google's Quantum Supremacy Circuit!
- Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov
RSS
Tag Archives: Daniela Kühn
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!
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 Abhishek Methuku, Daniela Kühn, Deryk Osthus, Dong Yeap Kang, Erdos-Faber-Lovasz conjecture, Tom Kelly
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.
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