12:30 -- 1:00: Registration
1:00 -- 1:50: Graphs with large chromatic number, Alex Scott, Oxford University
2:00 -- 2:50: The even map color theorem, Mark Ellingham, Vanderbilt University
3:00 -- 3:10: Break
3:10 -- 4:00: Infinite random geometric graphs on a circle, Yinon Spinka, University of British Columbia
4:10 -- 4:40: Increasing paths in countable hypergraphs, Bradley Elliott, Emory University
4:50 -- 5:20: On the local version of Sidorenko's conjecture, Fan Wei, Stanford University
5:30 -- 6:20: Decomposing graphs into edges and triangles, Bernard Lidicky, Iowa State University
9:00 -- 9:50: Graphs with forbidden induced subgraphs, Alex Scott, Oxford University
10:00 -- 10:50: Circular coloring of planar graphs, Dan Cranston, Virginia Commonwealth University
11:00 -- 11:50: Coloring graphs with forbidden minors, Zixia Song, University of Central Florida
12:00 -- 12:30: The extremal functions for triangle-free graphs with excluded minors, Youngho Yoo, Georgia Institute of Technology