• Jinyoung Park (박진영), A reformulation of Talagrand’s Discrete Convexity Conjecture

    Room B332 IBS (기초과학연구원)

    The "Convexity Conjecture" by Talagrand asks, roughly speaking, whether one can "create convexity" in a bounded number of steps regardless of the dimension of the ambient space. Talagrand also proposed a discrete version of this conjecture, calling it his "lifetime favorite problem" and offering a $1,000 prize for its solution. While the continuous version of

  • Ben Lund, TBA

    Room B332 IBS (기초과학연구원)
  • David Wood, Proof of the Clustered Hadwiger Conjecture

    Room B332 IBS (기초과학연구원)

    Hadwiger famously conjectured that every $K_h$-minor-free graph is properly $(h-1)$-colourable. This talk will present the following improper analogue of Hadwiger's Conjecture: for fixed $h$, every $K_h$-minor-free graph is $(h-1)$-colourable with monochromatic components of bounded size. The number of colours is best possible regardless of the size of monochromatic components. This solves an open problem of

  • Julien Codsi, TBA

    Room B332 IBS (기초과학연구원)