3 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2012★ 2 cited
2-Colored Matchings in a 3-Colored K^{3}_{12}
Neal Bushaw, Peter Csorba, Lindsay Erickson +5
Let denote the complete -uniform hypergraph on vertices. A matching in a hypergraph is a set of pairwise vertex disjoint edges. Recent Ramsey-type results re…
math.CO2012
Nim on hypercubes
Lindsay Erickson, Warren Shreve
The ordinary game of Nim has a long history and is well-known in the area of combinatorial game theory. The solution to the ordinary game of Nim has been known for many years and l…
math.CO2010★ 3 cited
Nim on the Complete Graph
Lindsay Erickson
The game of Nim as played on graphs was introduced in Nim on Graphs I and extended in Nim on Graphs II by Masahiko Fukuyama. His papers detail the calculation of Grundy numbers for…