Mason Shurman

activity

20222026

collaborators

3 papers

math.CO2026

An Upper Bound on the Hat Guessing Number of Graphs

Mason Shurman, Scott Albert Sibley

The hat guessing number $H G (G)$ of a graph is defined by the following game: each player is placed on a vertex and assigned a hat with one of $k$ 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 $D$ by Hamilton cycles is a collection of directed Hamilton cycles (not necessarily edge-disjoint) that together cover all the edges of $D$ . We prove that f…

math.CO2022

Antimagic Labeling for Unions of Graphs with Many Three-Paths

Angel Chavez, Parker Le, Derek Lin +2

Let $G$ be a graph with $m$ edges and let $f$ be a bijection from $E (G)$ to ${1, 2, \dots, m}$ . For any vertex $v$ , denote by $ϕ_{f} (v)$ the sum of $f (e)$ over all edges $e$ inciden…