Oliver Janzer and Benny Sudakov Settled the Erdős-Sauer Problem
Combinatorics and more 2022-05-21
Summary:
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 →