Geometric and Structural Graph Theory
Videos from BIRS Workshop
David Wood, Monash University
Monday Aug 21, 2017 09:01 - 10:01
Tutorial on defective and clustered graph colouring
Sergey Norin, McGill University
Monday Aug 21, 2017 10:23 - 11:12
Tutorial on defective colouring continued
Zi-Xia Song, University of Central Florida
Monday Aug 21, 2017 14:35 - 15:26
Coloring graphs with forbidden minors
Sang-il Oum, Institute for Basic Science
Monday Aug 21, 2017 15:50 - 16:10
Chi-boundedness of graph classes excluding wheel vertex-minors
Nicolas Trotignon, CNRS, France
Monday Aug 21, 2017 16:13 - 16:36
Polynomial chi-boundedness
Alex Scott, University of Oxford
Monday Aug 21, 2017 16:38 - 17:32
Holes in graphs of large chromatic number
Stéphan Thomassé,
Tuesday Aug 22, 2017 09:01 - 10:02
The Sands-Sauer-Woodrow conjecture
Petr Hlineny, Masaryk University
Tuesday Aug 22, 2017 10:31 - 10:54
Towards a structure theorem for crossing-critical graphs
Janos Pach, Renyi Institute of Mathematics
Tuesday Aug 22, 2017 10:57 - 11:19
Crossing numbers
Alan Arroyo, University of Waterloo
Tuesday Aug 22, 2017 11:24 - 11:47
Characterizing pseudolinear drawings of graphs in the plane
Martin Tancer, Charles University in Prague
Tuesday Aug 22, 2017 14:33 - 14:56
Shortest path embeddings of graphs on surfaces
Jan Kyncl, Charles University
Tuesday Aug 22, 2017 14:58 - 15:18
Counterexample to the Hanani-Tutte theorem on the surface of genus 4
Radoslav Fulek, IST Austria
Tuesday Aug 22, 2017 15:20 - 15:45
Hanani-Tutte for approximating maps of graphs
Daniela Kuhn, Birmingham University
Tuesday Aug 22, 2017 16:02 - 16:45
Proof of the tree packing conjecture for bounded degree trees
Deryk Osthus, Birmingham University
Tuesday Aug 22, 2017 16:47 - 17:31
Hypergraph $F$-designs exist for arbitrary $F$
Xingxing Yu, Georgia Institute of Technology
Wednesday Aug 23, 2017 09:01 - 10:01
The Kelmans-Seymour conjecture
Chun-Hung Liu, Texas A&M University
Wednesday Aug 23, 2017 10:36 - 10:53
Packing topological minors half-integrally
Zdenek Dvorak, Charles University
Wednesday Aug 23, 2017 10:54 - 11:18
Classes of graphs with strongly sublinear separators
Bojan Mohar, Simon Fraser University
Wednesday Aug 23, 2017 11:20 - 11:49
Maximum number of colourings and Tomescu's conjecture
Maria Chudnovsky, Princeton
Thursday Aug 24, 2017 09:02 - 09:52
Coloring graphs with forbidden induced subgraphs
Frederic Maffray, Laboratoire G-SCOP
Thursday Aug 24, 2017 10:31 - 10:50
A coloring algorithm for $4K_1$-free line graphs
Ngoc Khang Le, Ecole Normale Superieure Lyon
Thursday Aug 24, 2017 10:51 - 11:10
Detecting an induced subdivision of \(K_4\)
Sophie Spirkl, Princeton University
Thursday Aug 24, 2017 11:11 - 11:29
$P_6$-free triangle-free graphs
Kristina Vuskovic, University of Leeds
Thursday Aug 24, 2017 14:31 - 15:21
(Theta, wheel)-free graphs
Luke Postle, University of Waterloo
Thursday Aug 24, 2017 16:00 - 16:28
On a local version of Reed's conjecture
Jacob Fox, Stanford University
Thursday Aug 24, 2017 16:31 - 17:33
Tools in discrete geometry
