13 citations · 13 across the 2 of their papers we have counts for
2 papers
math.CO2018
Erdős-Szekeres On-Line
Kirk Boyer, Lauren M. Nelsen, Luke L. Nelsen +3
In 1935, Erdős and Szekeres proved that is the minimum number of points in the plane which definitely contain an increasing subset of points or a decreasing subs…
math.CO2018★ 13 cited
The zero forcing polynomial of a graph
Kirk Boyer, Boris Brimkov, Sean English +5
Zero forcing is an iterative graph coloring process, where given a set of initially colored vertices, a colored vertex with a single uncolored neighbor causes that neighbor to beco…