Discrete Applied Math Seminar by Evelyne Smith-Roberge: Counting Correspondence Colourings of Embedded Graphs

Speaker: 

Evelyne Smith-Roberge, Georgia Tech 

Title:

Counting Correspondence Colourings of Embedded Graphs

Abstract:

Langhede and Thomassen conjectured in 2020 that there exists a positive constant c such that every planar graph G with 5-correspondence assignment (L,M)  has at least 2^{c v(G)} distinct (L,M)-colourings. I will discuss a proof of this conjecture, a generalization of this result to some other embedded graphs, and a few open problems in the area. Everything presented is joint work with Luke Postle.

 

Discrete Applied Math Seminar

Request Zoom Link