3 papers
math.CO2026
Almost perfect graph classes
Cicely Henderson, Hidde Koerts, Taite LaGrange +4
A graph is perfect if for each induced subgraph of . In 2002, Chudnovsky, Robertson, Seymour, and Thomas famously proved the Strong Perfect Graph Theorem.…
math.CO2024
Acyclic List Colouring Locally Planar Graphs
Luke Postle, Evelyne Smith-Roberge, Massimo Vicenzo
A (vertex) colouring of graph is \emph{acyclic} if it contains no bicoloured cycle. In 1979, Borodin proved that planar graphs are acyclically 5-colourable. In 2010, Kawarabayashi…
math.PR2023
An Algorithm to Recover Shredded Random Matrices
Caelan Atamanchuk, Luc Devroye, Massimo Vicenzo
Given some binary matrix , suppose we are presented with the collection of its rows and columns in independent arbitrary orderings. From this information, are we able to recover…