Combinatorics Seminar: Fall 2009

Tuesday Sep 22
13:50-14:50 (IPAM 1200)	Wojtek Samotij (UIUC)	Counting graphs without a fixed complete bipartite subgraph
Thursday Sep 24
13:50-14:50 (IPAM 1200)	Jie Ma (Georgia Tech)	Judicious partition of graphs and hypergraphs
Tuesday Sep 29
13:50-14:50 (IPAM 1200)	David Ellis (Cambridge)	Intersecting families of permutations and some other extremal problems
Thursday Oct 01
13:50-14:50 (IPAM 1200)	Ameera Chowdhury (UCSD)	Shadows and intersections in vector spaces
Tuesday Oct 13
14:30-15:30 (IPAM common area, Note unusual time and place!)	Rani Hod (Tel Aviv University)	Optimal Monotone Encodings
Thursday Oct 15
15:00-16:00 (Physics and Astronomy Building, Room 1434A (immediately north-east of IPAM))	Gil Kalai (Hebrew University and Yale)	Analysis and Probability of Boolean Functions: Results and Problems (joint with Math colloqium)
Tuesday Oct 27
13:50-14:50 (IPAM 1200)	Jozsef Skokan (London School of Economics)	Ramsey-goodness .... and otherwise
Thursday Oct 29
13:50-14:50 (IPAM 1200)	Choongbum Lee (UCLA)	Resilience of Random Graphs
Tuesday Nov 10
13:50-14:50 (IPAM 1200)	Yury Person (Humboldt University)	(Hyper-)graph quasi-randomness
Thursday Nov 12
13:50-14:50 (IPAM 1200)	Kevin Woods (Oberlin)	Solving Lattice Point Problems Using Rational Generating Functions
Tuesday Nov 17
13:50-14:50 (IPAM 1200)	Peter Hegarty (Chalmers University)	A survey of some (lesser known ?) problems and results about sumsets
Thursday Nov 19
13:50-14:50 (IPAM 1200)	Po-Shen Loh (Princeton University )	Peer-to-peer clustering protocols
Tuesday Nov 24
13:50-14:50 (IPAM 1200)	Oleg Musin (UT Brownsville)	Bounds on sets with few distances