Combinatorics Reading Seminar

Graduate students under the direction of Fan Chung Graham have organized a reading seminar. The papers concern questions that are of current interest and have potential research problems.

Below is a schedule for the talks. As more people volunteer this list will grow, ideally we would like to get to the point where we have one presentation a week.

Date/time	Location	Presenter	Title	Links to relevant papers
June 23, 1:00pm	AP&M 6438	Steven Butler	Cycle avoidance in hypercubes	A Ramsey-type result for the hypercube, Subgraphs of a hypercube containing no small even cycles
June 29, 1:00pm	AP&M 6438	Ron Graham	Problems in Euclidean Ramsey Theory	Open problems in Euclidean Ramsey Theory, Euclidean Ramsey Theory
July 7, 1:00pm	AP&M 2402	Jake Wildstrom	Local search heuristics...	Local Search Heuristics for k-Median and Facility Location Problems
July 21, 1:00pm	AP&M 7421	Kevin Costello	Sparsifying Graphs	Fast Randomized Algorithms for Partitioning, Sparsification, and Solving Linear Systems, Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems
July 28, 1:00pm	AP&M 7421	Robert Elsaesser	Bounding the Communication Complexity of Randomized Broadcasting in Random-Like Graphs	Randomized rumor spreading, Bounding the communication complexity of randomized broadcasting algorithms in random-like graphs
August 11, 1:00pm	AP&M 7421	Jacob Fox	Ramsey theory on the integers and reals	On Rado's Boundedness Conjecture, The Clique Number of the Graph of Pairwise Sums and Products is 3 or 4, Infinite color analogue of Rado's theorem

DISCLAIMER: By presenting a paper you are not committed to having to do research related to that paper, by the same token if someone else presents a paper in which you are interested you are not discouraged to do research related to that paper. These presentations are meant to give an introduction to the material to those students interested in doing research, and to ensure that at least one person reads the relevant material. Ideally several students will become interested in a paper and work in a group to advance the ideas forward.

Combinatorics Reading Seminar - Summer 2005