2 citations · 3 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2008
Contributions to Seymour's Second Neighborhood Conjecture
James N. Brantner, Greg Brockman, Bill Kay +1
Let D be a simple digraph without loops or digons. For any v in V(D) let N_1(v) be the set of all nodes at out-distance 1 from v and let N_2(v) be the set of all nodes at out-dista…
math.CO2008★ 2 cited
Elementary Techniques for Erdos-Ko-Rado-like Theorems
Greg Brockman, Bill Kay
The well-known Erdos-Ko-Rado Theorem states that if F is a family of k-element subsets of {1,2,...,n} (n>2k-1) such that every pair of elements in F has a nonempty intersection, th…
math.CO2008★ 1 cited
On Universal Cycles of Labeled Graphs
Greg Brockman, Bill Kay, Emma E. Snively
A universal cycle is a compact listing of a class of combinatorial objects. In this paper, we prove the existence of universal cycles of classes of labeled graphs, including simple…