3 papers
cs.DS2025
Spectral partitioning of graphs into compact, connected regions
Ewan Davies, Ryan Job, Maxine Kampbell +2
We define and study a spectral recombination algorithm, SpecReCom, for partitioning a graph into a given number of connected parts. It is straightforward to introduce additional co…
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…