Workshop on Graph Theory and Combinatorics

Schedule (See conference booklet here for abstracts)

Time	Speaker	Title
9:00-9:30		Opening Remarks
9:40-10:30	Bojan Mohar	Game of cops and robber on geodesic spaces
10:30-10:50		Coffee break
10:50-11:40	Martin Loebl	Aspects of Kasteleyn Orientations
11:40-13:00		Lunch Break
13:00-13:50	Guoli Ding	Induced subgraphs and well-quasi-ordering
14:00-14:50	Sang-il Oum	Building the hierarchy of graph classes
14:50-15:10		Coffee Break
15:10-16:00	James Oxley	Generalizations of cographs for graphs and matroids
16:10-16:35	Andrea Jimenez	Grid subdivisions, wall minors and treewidth in planar graphs
16:45-17:10	Bogdan Oporowski	Unavoidable large 2-connected induced subgraphs
17:30-18:30	(In Skiles)	Cold Water challenge

Time	Speaker Name	Title
9:00-9:50	Maria Chudnovsky	Induced subgraphs and tree width
9:50-10:10		Coffee Break
10:10-11:00	Paul Wollan	Explicit bounds in graph minors
11:10-12:00	Zixia Song	Every graph with no K₈^-4 minor is 7-colorable
12:00-13:00		Lunch Break
13:00-13:50	Luke Postle	Generalizing and localizing the Four Color Theorem
14:00-14:50	Zdenĕk Dvořák	3-coloring triangle-free graphs on surfaces
15:00-15:25	Youngho Yoo	A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
15:30-16:00		Coffee Break
16:00-16:50	Chun-Hung Liu	Homomorphism counts in robustly sparse graphs
17:00-17:50	Bojan Mohar	On crossing-critical graphs
17:50--		Dinner

Time	Speaker Name	Title
9:00-9:50	Theo Molla	Minimum color degree thresholds for rainbow subgraphs
10:00-10:50	Jinyoung Park	Thresholds
10:50-11:10		Coffee Break
11:10-11:35	Rose McCarty	A combinatorial game for monadic stability
11:45-12:35	Dan Král'	Spectral method in extremal combinatorics