2 papers
math.CO2026
An Upper Bound on the Hat Guessing Number of Graphs
Mason Shurman, Scott Albert Sibley
The hat guessing number of a graph is defined by the following game: each player is placed on a vertex and assigned a hat with one of colors. Each vertex can see only t…
math.CO2024
Covering Random Digraphs with Hamilton Cycles
Asaf Ferber, Marcelo Sales, Mason Shurman
A covering of a digraph by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of . We prove that f…