May 24th
Today I learned the proof of the graph coloring combinatorial reciprocity theorem.\todo{}% prove the deletion-contraction functional equation: f_G = f_(G/e) + f_(G\e)% this is done by restricting colorings with c(v)=c(w) to an acyclic orientation in G/e% the others go to G\e; I'm pretty sure there's no overcounting% finish by induction on #E(G)