Tag Archives: Hong Liu

To cheer you up 14: Hong Liu and Richard Montgomery solved the Erdős and Hajnal’s odd cycle problem

The news: In 1981, Paul Erdős and András Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a graph with infinite chromatic number is necessarily infinite. Hong Liu and Richard Montgomery have just proved that … Continue reading

Posted in Combinatorics | Tagged , , , , | 7 Comments