BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Zdenek Dvorak (Charles University)
DTSTART:20211018T153000Z
DTEND:20211018T160000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /1/">Progress on number of 3-colorings of triangle-free planar graphs</a>\
 nby Zdenek Dvorak (Charles University) as part of BIRS workshop: New Persp
 ectives in Colouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sergey Norin (McGill University)
DTSTART:20211018T161000Z
DTEND:20211018T170000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /2/">The extremal function of minor-closed graph classes</a>\nby Sergey No
 rin (McGill University) as part of BIRS workshop: New Perspectives in Colo
 uring and Structure\n\n\nAbstract\nFor a graph class $\\mathcal{F}$\, let 
 $ex_{\\mathcal{F}}(n)$ denote the maximum number of edges in an $n$-vertex
  graph in $\\mathcal{F}$.\nJointly with Rohan Kapapia\, we've proved that
   $ex_{\\mathcal{F}}(n)$ is a sum of a linear function and an eventuall
 y periodic function for every proper\nminor-closed graph class $\\mathcal{
 F}$.\nWe will discuss the proof and consequences of this theorem and relat
 ed  open\nquestions.\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Luke Postle (University of Waterloo)
DTSTART:20211019T143000Z
DTEND:20211019T152000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /3/">Reducing linear Hadwiger's conjecture to coloring small graphs</a>\nb
 y Luke Postle (University of Waterloo) as part of BIRS workshop: New Persp
 ectives in Colouring and Structure\n\n\nAbstract\nIn 1943\, Hadwiger conje
 ctured that every graph with no $K_t$ minor is $(t-1)$-colorable for every
  $t ≥ 1$. In the 1980s\, Kostochka and Thomason independently proved tha
 t every graph with no $K_t$ minor has average degree $O(t (log t)^{0.5})$ 
 and hence is $O(t (log t)^{0.5})$-colorable.  In a recent breakthrough\, N
 orin\, Song\, and I proved that every graph with no $K_t$ minor is $O(t lo
 g t)^c)$-colorable for every $c > 0.25$\,  Subsequently I showed that ever
 y graph with no  $K_t$ minor is $O(t (log log t)^6)$-colorable.  We improv
 e upon this further by showing that every graph with no $K_t$ minor is $O(
 t log log t)$-colorable.   Our main technical result yields this as well a
 s a number of other interesting corollaries.  A natural weakening of Hadwi
 ger's Conjecture is the so-called Linear Hadwiger's Conjecture that every 
 graph with no $K_t$ minor is $O(t)$-colorable.  We prove that Linear Hadwi
 ger's Conjecture reduces to small graphs. In 2003\, Kühn and Osthus prove
 d that Hadwiger’s Conjecture holds for graphs of girth at least five (pr
 ovided that t is sufficiently large). In 2005\, Kühn and Osthus extended 
 this result to the class of $K_{s\,s}$-free graphs for any fixed positive 
 integer $s ≥ 2$. Along this line\, we show that Linear Hadwiger's Conjec
 ture holds for the class of $K_r$-free graphs for every fixed $r$.  This i
 s joint work with Michelle Delcourt.\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marthe Bonamy (Laboratoire Bordelais de Recherche en Informatique)
DTSTART:20211019T153000Z
DTEND:20211019T160000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /4/">Exploring the space of colourings with Kempe changes</a>\nby Marthe B
 onamy (Laboratoire Bordelais de Recherche en Informatique) as part of BIRS
  workshop: New Perspectives in Colouring and Structure\n\n\nAbstract\nKemp
 e changes were introduced in 1879 in an attempt to prove the\n4-colour the
 orem. They are a convenient if not crucial tool to prove various\ncolourin
 g theorems. Here\, we consider how to navigate from a colouring to\nanothe
 r through Kempe changes. When is it possible? How fast?\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jacob Fox (Stanford University)
DTSTART:20211019T161000Z
DTEND:20211019T170000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /5/">The structure of triangle-free graphs</a>\nby Jacob Fox (Stanford Uni
 versity) as part of BIRS workshop: New Perspectives in Colouring and Struc
 ture\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chun-Hung Liu (Texas A&M University)
DTSTART:20211020T210000Z
DTEND:20211020T215000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /6/">Weak diameter coloring of minor-closed families in large scale</a>\nb
 y Chun-Hung Liu (Texas A&M University) as part of BIRS workshop: New Persp
 ectives in Colouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:David Wood (Monash University))
DTSTART:20211020T220000Z
DTEND:20211020T225000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /7/">Universality for minor-closed classes with applications to graph colo
 uring</a>\nby David Wood (Monash University)) as part of BIRS workshop: Ne
 w Perspectives in Colouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ken-ichi Kawarabayashi (National Institute of Informatics)
DTSTART:20211020T230000Z
DTEND:20211020T235000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /8/">Low diameter decomposition\, polylogarithmic approximation for direct
 ed sparsest-cut\, and embedding into directed ℓ1ℓ1ℓ1 for directed pl
 anar graph</a>\nby Ken-ichi Kawarabayashi (National Institute of Informati
 cs) as part of BIRS workshop: New Perspectives in Colouring and Structure\
 n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Louis Esperet (CNRS)
DTSTART:20211021T143000Z
DTEND:20211021T150000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /9/">Coloring unit disk graphs</a>\nby Louis Esperet (CNRS) as part of BIR
 S workshop: New Perspectives in Colouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Bartosz Walczak (Jagiellonian University)
DTSTART:20211021T151000Z
DTEND:20211021T160000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /10/">Coloring ordered graphs with excluded induced ordered subgraphs</a>\
 nby Bartosz Walczak (Jagiellonian University) as part of BIRS workshop: Ne
 w Perspectives in Colouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nicolas Trotignon (CNRS - École Normale Supérieure de Lyon)
DTSTART:20211021T161000Z
DTEND:20211021T170000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /11/">Burling graphs revisited</a>\nby Nicolas Trotignon (CNRS - École No
 rmale Supérieure de Lyon) as part of BIRS workshop: New Perspectives in C
 olouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maria Chudnovsky (Princeton University)
DTSTART:20211022T143000Z
DTEND:20211022T152000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/12
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /12/">Induced subgraphs and tree decompositions</a>\nby Maria Chudnovsky (
 Princeton University) as part of BIRS workshop: New Perspectives in Colour
 ing and Structure\n\n\nAbstract\nTree decompositions are a powerful tool i
 n structural graph\ntheory\; they are  traditionally used in the context o
 f forbidden graph minors.\nConnecting tree decompositions and forbidden in
 duced subgraphs has until\nrecently remained out of reach. $$ $$\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sophie Spirkl (University of Waterloo)
DTSTART:20211022T153000Z
DTEND:20211022T160000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /13/">Logarithmic treewidth</a>\nby Sophie Spirkl (University of Waterloo)
  as part of BIRS workshop: New Perspectives in Colouring and Structure\n\n
 Abstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marcin Pilipczuk (University of Warsaw)
DTSTART:20211022T161000Z
DTEND:20211022T170000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/14
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /14/">The Gyárfás' path argument and quasi-polynomial time algorithms in
  P_t-free graphs</a>\nby Marcin Pilipczuk (University of Warsaw) as part o
 f BIRS workshop: New Perspectives in Colouring and Structure\n\nAbstract: 
 TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paweł Rzążewski (Warsaw University of Technology)
DTSTART:20211022T171000Z
DTEND:20211022T180000Z
DTSTAMP:20260422T185331Z
UID:BIRS-21w5513/15
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BIRS-21w5513
 /15/">Polynomial-time algorithm for Maximum Independent Set in bounded-deg
 ree graphs with no long induced claws</a>\nby Paweł Rzążewski (Warsaw U
 niversity of Technology) as part of BIRS workshop: New Perspectives in Col
 ouring and Structure\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BIRS-21w5513/15/
END:VEVENT
END:VCALENDAR