4 papers
Colored Multipermutations and a Combinatorial Generalization of Worpitzky's Identity
John Engbers, Jay Pantone, Christopher Stocker
Worpitzky's identity expresses in terms of the Eulerian numbers and binomial coefficients: Pita-Ruiz recent…
Maximizing and minimizing the number of generalized colorings of trees
John Engbers, Christopher Stocker
We classify the trees on vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rain…
Reversible peg solitaire on graphs
John Engbers, Christopher Stocker
The game of peg solitaire on graphs was introduced by Beeler and Hoilman in 2011. In this game, pegs are initially placed on all but one vertex of a graph . If forms a pat…
Overlap Number of Graphs
Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier +4
An {\it overlap representation} of a graph assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other…