Benny Sudakov studies combinatorics, especially extremal and probabilistic questions. His ETH author page documents work in these areas.[ref]
With David Conlon, Jacob Fox and Choongbum Lee, he developed bounds for ordered Ramsey numbers. Their work compares the order-preserving problem with the ordinary Ramsey number and demonstrates a large gap for some ordered matchings.[ref]
Ordered Ramsey numbers by David Conlon and others. Abstract and introduction
Articles by others on the same topic
Benny Sudakov is a prominent mathematician known for his contributions to various fields, including combinatorics, graph theory, and discrete mathematics. He has published numerous papers and is recognized for his work in areas such as extremal graph theory and probabilistic methods in combinatorics. He has also held academic positions at various institutions and has been involved in the mathematical research community.