Schedule of Talks
PDF of Abstracts
The conference program consisted of about 50 invited speakers and are listed below. A poster session was scheduled and open to everyone. Title and abstracts from invited speakers as well as poster presentations are posted. When available, presentation links are included below as well as a picture of each speaker.
Monday, May 7, 2012
| Time | Speaker | Title |
|---|---|---|
| 8:50 -- 9:00 | Doug Ulmer, Chair, SoM | Opening Remarks |
| 9:00 -- 9:50 | Paul Seymour | Induced Subgraphs and Subtournaments |
| 10:00--10:25 | Guoli Ding | Refinements of Archdeacon Theorem |
| 10:30--10:55 | Martin Loebl | Extending Polynomials in Combinatorics |
| 10:55--11:10 | Coffee Break | |
| 11:10--12:00 | Maria Chudnovsky | Forcing Large Transitive Subtournamets |
| 12:00--1:30 | Lunch | |
| 1:30 -- 2:20 | Bojan Mohar | Large Clique Minors in Vertex Transitive Graphs |
| 2:30 -- 2:55 | Zdenek Dvorak | Coloring Graphs on Surfaces |
| 3:00 -- 3:25 | Gelasio Salazar | Embeddability of Infinite Graphs |
| 3:30 -- 3:55 | Coffee Break | |
| 4:00 -- 4:50 | Stephan Thomasse | On Some Chi-Bounded Classes of Graphs |
| 5:00 -- 5:25 | Jiri Matousek | Discrepancy, Bansal's Algorithm and the Determinant Bound |
| 5:30 -- 5:55 | Mihyun Kang | On the Connectivity of Random Graphs from Addable Classes |
| Time | Speaker | Title |
|---|---|---|
| 9:00 -- 9:50 | Bruce Reed | Separators, Brambles, Tree Decompositions and Excluding Clique Minors |
| 10:00--10:25 | Stephan Kreutzer | Linkless Embeddings in the 3-space |
| 10:30--10:55 | Daniel Marx | Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs |
| 10:55--11:10 | Coffee Break | |
| 11:10--12:00 | Ken-ichi Kawarabayashi | Coloring 3-Colorable Graphs; Graph Theory Finally Strikes Back! |
| 12:00--1:30 | Lunch | |
| 1:30 -- 2:20 | Jim Geelen | Growth-Rates of Matroid Classes |
| 2:30 -- 2:55 | Geoff Whittle | Tangles, Trees and Flowers |
| 3:00 -- 3:25 | James Oxley | Unavoidable Minors of Large 2- and 3-Connected Matroids |
| 3:30 -- 3:55 | Coffee Break/Poster Session | |
| 4:00 -- 4:50 | Neil Robertson | Topologically Well-quasi-ordered Classes of Graphs |
| 5:00 -- 5:25 | Bertrand Guenin | Multi-flow and Algorithm |
| 5:30 -- 5:55 | Jan Kratochvil | Minors of Partially Embedded Graphs |
| Time | Speaker | Title |
|---|---|---|
| 9:00 -- 9:50 | Jaroslav Nesetril | Subgraph Statistics for Geometric Graphs |
| 10:00--10:25 | Vojtech Rodl | On Subgraphs of Large Girth |
| 10:30--10:55 | Alexandr Kostochka | A Refinement of the Triangle Version of the Corradi-Hajnal Theorem |
| 10:55--11:10 | Coffee Break | |
| 11:10--12:00 | Dhruv Mubayi | Intersection Theorems for Finite Sets |
| 12:00--1:30 | Lunch | |
| 1:30 -- 2:20 | Dan Kral | Deciding Properties in Sparse Combinatorial Structures |
| 2:30 -- 2:55 | Jessica McDonald | Clique Immersion in Digraphs |
| 3:00 -- 3:25 | Gwenael Joret | Excluded Forest Minors and the Erdos-Posa Property |
| 3:30 -- 3:55 | Coffee Break/Poster Session | |
| 4:00 -- 4:25 | Penny Haxell | On Matchings and Covers |
| 4:30 -- 4:55 | Jie Ma | Extremal Problems in Eulerian Digraphs |
| 5:00 -- 5:25 | Vida Dujmovic | Nonrepetitive Colourings |
| 5:30 -- 5:55 | Sang-il Oum | Graphs of Small Rank-Width are Pivot-Minors of Graphs of Small Tree-Width |
| Time | Speaker | Title |
|---|---|---|
| 9:00 -- 9:50 | Paul Seymour | Tutte's Three-Edge-Colouring Conjecture |
| 10:00--10:25 | Bruce Richter | Embedding Continuua into a Surface |
| 10:30--10:55 | Tom Trotter | Planarity and Dimension for Graphs and Posets |
| 10:55--11:05 | Coffee Break | |
| 11:05--11:30 | Petr Hlineny | Testing Graph MSO Properties: Has it all been told already? |
| 11:30--12:00 | Chun-Hung Liu | An Upper Bound on the Fractional Chromatic Number of Triangle-Free Subcubic Graphs |
| 12:00--1:30 | Lunch | |
| 1:30 -- 2:20 | Paul Wollan | Excluding a Clique Immersion |
| 2:30 -- 2:55 | Luke Postle | 5-List-Coloring Graphs on Surfaces |
| 3:00 -- 3:25 | Peter Whalen | Braces and Pfaffian Orientations |
| 3:30 -- 3:55 | Coffee Break/Poster Session | |
| 4:00 -- 4:25 | Zi-Xia Song | Clique Minors and Odd Clique Minors in Graphs |
| 4:30 -- 4:55 | Carl Yerger | Progress on Steinberg's Conjecture: History and Recent Results |
| 5:00 -- 5:25 | Arash Asadi | 3-Connected Minor Minimal Non-Projective Planar Graphs with an Internal 3-Separation |
| 7:00 -- 9:00 | Banquet at the Georgia Tech Hotel and Conference Center | |
| Time | Speaker | Title |
|---|---|---|
| 9:00 -- 9:50 | Michel Goemans | Thin Spanning Trees |
| 10:00--10:25 | Hiroshi Hirai | On Tractability of Minimum 0-Extension Problems |
| 10:30--10:55 | Satoru Iwata | Pfaffian Orientation, Symmetric Matrices, and Linear Programming |
| 10:55--11:10 | Coffee Break | |
| 11:10--12:00 | Alexander Schrijver CANCELLED due to family emergency | On Limits of Edge-Coloring Models |
| 12:00--1:30 | Lunch | |
| 1:30 -- 2:20 | Jacob Fox | Extremal Results in Sparse Pseudorandom Graphs |
| 2:30 -- 2:55 | Bruce Shepherd | From Online Colouring to Online Vector Bin Packing |
| 3:00 -- 3:25 | Hein Van der Holst | A Colin de Verdiere-Type Invariant and Odd-K_4- and Odd-K^2_3-Free Signed Graphs |
| 3:30 -- 3:55 | Coffee Break | |
| 4:00 -- 4:50 | Laszlo Lovasz | Extremal Graphs and Graph Limits |
