Landon Rabern
Published 2012-05-15, updated 2013-06-25Version 5
Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.
Comments: added cute Kernel Lemma trick to lift up to (online) list coloring
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set
On Roussel-Rubio-type lemmas and their consequences
The size of the giant component in random hypergraphs: a short proof
![QR code for arXiv:1205.3253 [math.CO]](http://oss.arxitics.com/images/favicon.svg)