4 papers
ErdÅs-Ko-Rado Theorems for Paths in Graphs
Neal Bushaw, James Danielsson, Glenn Hurlbert
A family of sets is -intersecting if every pair of its sets has at least elements in common. It is an -star if all its members have some elements in common. A family…
A New Dominating Set Game on Graphs
Sean Fiscus, Glenn Hurlbert, Eric Myzelev +1
We introduce a new two-player game on graphs, in which players alternate choosing vertices until the set of chosen vertices forms a dominating set. The last player to choose a vert…
Intersecting Families of Spanning Trees
Peter Frankl, Glenn Hurlbert, Ferdinand Ihringer +4
A family of spanning trees of the complete graph on vertices is \emph{-intersecting} if any two members have a forest on edges in common. We prove an…
A Survey of the Holroyd-Talbot Conjecture
Glenn Hurlbert
A family of sets is intersecting if every pair of its members has an element in common. Such a family of sets is called a star if some element is in every set of the family. Given…