4 papers
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…
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…
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…
Antimagic Labeling for Unions of Graphs with Many Three-Paths
Angel Chavez, Parker Le, Derek Lin +2
Let be a graph with edges and let be a bijection from to . For any vertex , denote by the sum of over all edges inciden…