A combinatorial construction of a non-measurable set

Research Horizons Seminar
Wednesday, March 7, 2012 - 12:05
1 hour (actually 50 minutes)
Skiles 005
Georgia Tech
I will present a construction of a non-measurable set using the fundamental fact that a graph with no odd cycles is 2-colorable. That will not take very long, even though I will prove everything from first principles. In the rest of the time I will discuss the Axiom of Choice and some unprovable statements. The talk should be accessible to undergraduates.