Schedule

Friday (9th January)

Arrival day.

Saturday

9.00: Presentation of open problems. Here is a link to the problems so far submitted, maintained by Julien Codsi.

Sunday

9:00 Presentation of open problems, continued.

10:00 Daniel Carter, ``Weightable digraphs''

4:00 Raphael Steiner, ``Disproof of the odd Hadwiger conjecture''

Monday

9:00 Marcin Pilipczuk, ``Forbidding structures in metric spaces''

10:00 Progress reports and open problems.
Reports by:
  Jim Geelen,``Deleting or contracting an edge without splitting a tangle''
  Sergey Norin, ``Proof of a version of Bruce Reed's question on edge-density''
  Marcin Pilipczuk, ``Disproof of a conjecture of Julien Codsi on balanced separators in planar graphs''
  Rose McCarty, ``Linearly (tw, \omega)-bounded classes do not necessarily come from bounded treewidth classes''

4:00 Tung Nguyen, ``P_5-free graphs are poly-chi-bounded''

Tuesday

9:00 Stephan Thomasse, ``Optimistic optimization''

10:00 Maria Chudnovsky, ``Tree-decompositions when induced things are excluded''

11:00 Progress reports and open problems.
Reports by:
   Tony Huynh, ``Improved bounds for disjoint cycles in graphs with distinct lengths''
   Kevin Hendrey, ``Counterexample to a conjecture of Huynh on disjoint cycles in digraphs with distinct lengths''
   Michal Pilipczuk, ``Hitting all maximum independent sets in graphs of bounded linear rank-width''
   Raphael Steiner, ``Colouring ideal clutters with few hyperedge sizes"
4:00 James Davies, ``CAT(0) square complexes and chi-boundedness''

7:00 Quiz night at Tipsy Monkey.

Wednesday


9:00 Louis Esperet, ``Periodic colourings and orientations''

10:00 Progress reports by:
  Paul Wollan, ``(Further) improved bounds for disjoint cycles in graphs with distinct lengths, and progress towards Seymour's conjecture on coarse Menger in series-parallel graphs''
  Jim Geelen, ``How to describe a tangle''
10:20 Sepehr Hajebi, ``Polynomial pathwidth''

2:10 Excursion (snorkling trip)

8:00 Dinner at SeaCat

Thursday


9:00 Meike Hatzel, ``Onions and potatoes; aka directed tree-cut-width''

10:00 Sang-Il Oum, ``An algorithm to test whether a connectivity function has a branch-deomposition of width at most k''

4:00 Progress reports by
  Alex Divoux, ``Proof of a conjecture of Seymour''
  Kevin Hendrey, ``Proof of a conjecture of Esperet''
  Sepehr Hajebi, ``Refining (treewidth, omega)-boundedness''

4:30 Rose McCarty, ``Matroids of high girth''

Friday (16th January)

Departure day.