Tag Archives: Oliver Janzer

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

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 , | 6 Comments