Title: Applying Graph Coloring to Partitions of Sum Free Sets
Speaker: Charles Wolf, Rutgers University
Date: Wednesday, April 4, 2012 12:10pm
Location: Graduate Student Lounge, 7th Floor, Hill Center, Rutgers University, Busch Campus, Piscataway, NJ
Sometimes when I go to a party, I see many people I know and many people that I don't. I wonder how many of them know already either know each other or don't. In this talk, I will discuss solutions of this problem using graph coloring called Ramsey's Theorem. I will also apply Ramsey's theorem to Schur numbers, which involves partitioning the first n natural numbers into sum free sets.
Graduate Student Combinatorics Seminars