Ideas.md

Ideas for discrete book

Exercises

Graph Theory

• Show that for every $n \ge 5$ there is a graph with $n$ vertices all of degree 4. You can do this by regular induction or by strong induction (taking the union of graphs with between 5 and 9 vertices).