Tag Archives: Independent sets in graphs

A Couple Updates on the Advances-in-Combinatorics Updates

Posted on July 10, 2011 by

In a recent post I mentioned quite a few remarkable recent developments in combinatorics. Let me mention a couple more. Independent sets in regular graphs A challenging conjecture by Noga Alon and Jeff Kahn in graph theory was about the number of … Continue reading →

Posted in Combinatorics, Open problems, Updates | Tagged , | 4 Comments