Tag Archives: David Conlon

The Brown-Erdős-Sós 1973 Conjecture

Greetings from Oberwolfach.  This week, there is a great meeting here on combinatorics. In this post I want to state the Brown-Erdős-Sós conjecture and one of its variants. The trigger was a beautiful talk I heard from Lior Gishboliner on … Continue reading

Posted in Combinatorics | Tagged , , , , , , , , , , , , , , | 2 Comments

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

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