Strong product theorems in graph theory (may 2020)



Talks available at https://webconf.u-bordeaux.fr/b/mar-pmc-ht6



Program


Monday 25 may

10:30-12:00 A general introduction (including applications to queue number), by Gwenael Joret, based on https://arxiv.org/pdf/1807.03683.pdf and https://arxiv.org/pdf/1904.04791.pdf

14:00-14:45 The non-repetitive coloring consequences, by Louis Esperet, based on https://arxiv.org/pdf/1904.05269.pdf


Wednesday 27 may

11:00-12:00 $p$-centered colouring, by Felix Schröder, based on https://arxiv.org/pdf/1907.04586.pdf

14:00-14:30 Subgraph isomorphism, by Edouard Bonnet, based on https://arxiv.org/pdf/1807.03683.pdf


Friday 29 may

13:30-14:30 Extensions to other graph classes (bounded genus and other minor-closed classes, k-planar, etc), by Daniel Gonçalves, based on https://arxiv.org/pdf/1907.05168.pdf and https://arxiv.org/pdf/2002.11721.pdf

14:45-15:45 Consequences for adjacency labelling schemes, by Cyril Gavoille, based on https://arxiv.org/abs/1908.03341 and https://arxiv.org/abs/2003.04280



Organized by Marthe Bonamy, Nicolas Bousquet, Louis Esperet, and Daniel Gonçalves

Blix theme adapted by David Gilbert, powered by PmWiki