Tag Archives: Benny Sudakov

Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem

Posted on May 20, 2022 by Gil Kalai

Norbert Sauer The news in brief:  In the new paper Resolution of the Erdős-Sauer problem on regular subgraphs Oliver Janzer and Benny Sudakov proved that any graph G with vertices and more than edges contains a k-regular subgraph. This bound … Continue reading →

Posted in Combinatorics | Tagged , | 9 Comments

Ringel Conjecture, Solved! Congratulations to Richard Montgomery, Alexey Pokrovskiy, and Benny Sudakov

Posted on January 27, 2020 by Gil Kalai

Ringel’s conjecture solved (for sufficiently large n) A couple weeks ago and a few days after I heard an excellent lecture about it by Alexey Pokrovskiy in Oberwolfach, the paper A proof of Ringel’s Conjecture by Richard Montgomery, Alexey Pokrovskiy, … Continue reading →

Posted in Combinatorics, Open problems, Updates | Tagged , , | 5 Comments

Jacob Fox, David Conlon, and Benny Sudakov: Vast Improvement of our Knowledge on Unavoidable Patterns in Words

Posted on January 11, 2018 by Gil Kalai

I heard a lecture by Benny Sudakov on the remarkable paper  Tower-type bounds for unavoidable patterns in words, by David Conlon, Jacob Fox, and Benny Sudakov.  Here are the slides, and let me let the slides speak for themselves. The problem

Posted in Combinatorics | Tagged , , , | Leave a comment

A lecture by Noga

Posted on October 9, 2014 by Gil Kalai

Noga with Uri Feige among various other heroes A few weeks ago I devoted a post to the 240-summit conference for Péter Frankl, Zoltán Füredi, Ervin Győri and János Pach, and today I will bring you the slides of Noga … Continue reading →

Posted in Combinatorics, Conferences | Tagged , , , , , , | Leave a comment