Special Session on Extremal and Probabilistic Combinatorics

Organizers: Stephen Hartke and Jamie Radcliffe
Code: SS 5A

AMS Central Section Meeting
University of Nebraska-Lincoln (Math Dept: local info)
October 14-16, 2011 (Friday - Sunday)

Information

Talks in our special session will be scheduled from Friday afternoon through Sunday morning. Specifically, there will be 4 talks on Fri Oct 14 from 4-6pm; 5 talks in the morning on Sat Oct 15 from 8:30am-11am, and 4 talks in the afternoon from 2:30pm-4:30pm; and 6 talks in the morning on Sun Oct 16 from 8:00am-11:30am.
Friday, October 14: There is a Graduate Student Poster Session at the Holiday Inn at 8pm (registration).
Saturday, October 15: The Erdős lecture ends at 5:30pm and is followed by a reception until 6:30pm in the Union. We will have a session dinner at The Oven at 7pm.
Our session will be Avery Hall Room 118. The room has an electronic projector whose inputs can come frome either a document camera, laptop, or a usb drive plugged into the computer in the room. There is also a whiteboard behind the screen; see this picture. There is also a wireless network that visitors can access; you need to register your laptop to be able to access the campus wireless network; here are instructions for how to register before you arrive.

Schedule of Talks

Friday October 14, 2011
4:00pm	Note: talk moved to 4:30pm
4:30pm	Anant Godbole, East Tennessee State	Hitting random set systems
5:00pm	Rob Ellis, Illinois Institute of Technology	Identification of strategies for liar-type games via discrepancy from their linear approximations
5:30pm	Andrew Beveridge, Macalester College	Cops and Robbers on Geometric Graphs

Saturday October 15, 2011
8:30am	Douglas West, U. of Illinois at Urbana-Champaign	The Chinese Postman Problem in regular graphs of odd degree.
9:00am	Mike Barrus, Black Hills State U.	Residues and independence numbers of unigraphs
9:30am	Michael Ferrara, U. of Colorado Denver	Pancyclicity of 4-Connected, Claw-Free, $P_{10}$-Free Graphs
10:00am	Hemanshu Kaul, Illinois Inst. of Tech.	Finding Large Induced Subgraphs
10:30am	Ryan Martin, Iowa State U.	On the edit distance for $K_{2,t}$-free graphs

2:30pm	Bill Kinnersley, U. of Illinois at Urbana-Champaign	Degree Ramsey numbers of double-stars
3:00pm	Michael Young, Iowa State U.	Anti-Ramsey number of matchings in hypergraphs
3:30pm	Paul Wenger, U. of Colorado Denver	$\delta(G)$-Size Rainbow Matchings in Properly Edge-Colored Graphs
4:00pm	Matthew Yancey, U. of Illinois at Urbana-Champaign	Large Rainbow Matchings in Graphs

Sunday October 16, 2011
8:00am	Jeremy Martin, U. of Kansas	Spanning trees of shifted simplicial complexes
8:30am	Rebecca Swanson, Nebraska Wesleyan U.	Combinatorial Proofs of Some Chromatic Polynomial Constraints
9:00am	Jane Butterfield, U. of Illinois at Urbana-Champaign	On the Chromatic Thresholds of Hypergraphs
9:30am	break
10:00am	David Galvin, U. of Notre Dame	Counting graph homomorphisms
10:30am	Jon Cutler, Montclair State U.	Independent sets in graphs with given minimum degree
11:00am	Aaron Dutle, U. of South Carolina	Spectra of Hypergraphs

This page last modified October 12, 2011.