Showing math.COShow all
3 papers · 1 filter
math.CO2025
Local Weak Degeneracy of Planar Graphs
Ewan Davies, Evelyne Smith-Roberge
Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs…
math.CO2025
The hard-core model in graph theory
Ewan Davies, Ross J. Kang
An independent set may not contain both a vertex and one of its neighbours. This basic fact makes the uniform distribution over independent sets rather special. We consider the har…
math.CO2024
Sampling List Packings
Evan Camrud, Ewan Davies, Alex Karduna +1
We study the problem of approximately counting the number of list packings of a graph. The analogous problem for usual vertex coloring and list coloring has attracted a lot of atte…