Geometric and Structural Graph Theory

Videos from BIRS Workshop

, Monash University
- 10:01
Tutorial on defective and clustered graph colouring
Watch video | Download video: 201708210901-Wood.mp4 (203M)
, McGill University
- 11:12
Tutorial on defective colouring continued
Watch video | Download video: 201708211023-Norin.mp4 (200M)
, University of Central Florida
- 15:26
Coloring graphs with forbidden minors
Watch video | Download video: 201708211435-Song.mp4 (161M)
, Institute for Basic Science
- 16:10
Chi-boundedness of graph classes excluding wheel vertex-minors
Watch video | Download video: 201708211550-Oum.mp4 (70M)
, CNRS, France
- 16:36
Polynomial chi-boundedness
Watch video | Download video: 201708211613-Trotignon.mp4 (89M)
, University of Oxford
- 17:32
Holes in graphs of large chromatic number
Watch video | Download video: 201708211638-Scott.mp4 (232M)
,
- 10:02
The Sands-Sauer-Woodrow conjecture
Watch video | Download video: 201708220901-Thomasse.mp4 (246M)
, Masaryk University
- 10:54
Towards a structure theorem for crossing-critical graphs
Watch video | Download video: 201708221031-Hlineny.mp4 (71M)
, Renyi Institute of Mathematics
- 11:19
Crossing numbers
Watch video | Download video: 201708221057-Pach.mp4 (79M)
, University of Waterloo
- 11:47
Characterizing pseudolinear drawings of graphs in the plane
Watch video | Download video: 201708221124-Arroyo.mp4 (85M)
, Charles University in Prague
- 14:56
Shortest path embeddings of graphs on surfaces
Watch video | Download video: 201708221433-Tancer.mp4 (71M)
, Charles University
- 15:18
Counterexample to the Hanani-Tutte theorem on the surface of genus 4
Watch video | Download video: 201708221458-Kyncl.mp4 (67M)
, IST Austria
- 15:45
Hanani-Tutte for approximating maps of graphs
Watch video | Download video: 201708221520-Fulek.mp4 (75M)
, Birmingham University
- 16:45
Proof of the tree packing conjecture for bounded degree trees
Watch video | Download video: 201708221602-Kuhn.mp4 (140M)
, Birmingham University
- 17:31
Hypergraph $F$-designs exist for arbitrary $F$
Watch video | Download video: 201708221647-Osthus.mp4 (193M)
, Georgia Institute of Technology
- 10:01
The Kelmans-Seymour conjecture
Watch video | Download video: 201708230901-Yu.mp4 (256M)
, Texas A&M University
- 10:53
Packing topological minors half-integrally
Watch video | Download video: 201708231036-Liu.mp4 (49M)
, Charles University
- 11:18
Classes of graphs with strongly sublinear separators
Watch video | Download video: 201708231054-Dvorak.mp4 (80M)
, Simon Fraser University
- 11:49
Maximum number of colourings and Tomescu's conjecture
Watch video | Download video: 201708231120-Mohar.mp4 (140M)
, Princeton
- 09:52
Coloring graphs with forbidden induced subgraphs
Watch video | Download video: 201708240902-Chudnovsky.mp4 (221M)
, Laboratoire G-SCOP
- 10:50
A coloring algorithm for $4K_1$-free line graphs
Watch video | Download video: 201708241031-Maffray.mp4 (58M)
, Ecole Normale Superieure Lyon
- 11:10
Detecting an induced subdivision of \(K_4\)
Watch video | Download video: 201708241051-Le.mp4 (80M)
, Princeton University
- 11:29
$P_6$-free triangle-free graphs
Watch video | Download video: 201708241111-Spirkl.mp4 (68M)
, University of Leeds
- 15:21
(Theta, wheel)-free graphs
Watch video | Download video: 201708241431-Vuskovic.mp4 (169M)
, University of Waterloo
- 16:28
On a local version of Reed's conjecture
Watch video | Download video: 201708241600-Postle.mp4 (84M)
, Stanford University
- 17:33
Tools in discrete geometry
Watch video | Download video: 201708241631-Fox.mp4 (219M)