Combinatorialists in the news

Mathematicians Answer Old Question About Odd Graphs

A pair of mathematicians solved a legendary question about the proportion of vertices in a graph with an odd number of connections.
For decades, mathematicians have debated a simple question about graphs and the number of connections they have. Consider a graph G and a subgraph H such that all the vertices of H have odd degree.  The minimum size of such an H is now known.  Now, using arguments an undergraduate math student could have come up with, Asaf Ferber of the University of California, Irvine and Michael Krivelevich of Tel Aviv University have finally provided the answer in the form of a proof posted in March.


Popular posts from this blog

The Combinatorics 2018 conference June 3 to 9, 2018 in Arco, Province of Trento, Italy

Announcement of virtual conference

In Memoriam Peter Borwein