I'll discuss recent progress on Goldbach's conjecture via the pigeonhole principle

What do spanning trees, graph flows, graph coloring, and network reliability have in common? They can all be studied by a single polynomial! The Tutte polynomial is a remarkably powerful graph invariant that encodes a wide variety of combinatorial information. This talk will explore its construction and some of its evaluations through examples to examine seemingly unrelated information about a graph.