Showing 2026Show all
2 papers · 1 filter
math.CO2026
Almost All 3-uniform Hypergraphs are Class 1
Arnab Chaterjee, Asaf Ferber, Marcelo Sales +1
The chromatic index of a hypergraph is the smallest number of colors needed to color its edges so that no two adjacent edges share the same color. The chromatic index i…
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…