2 papers
math.CO2007
A new proof of the Erdős-Ko-Rado theorem for intersecting families of permutations
Chris Godsil, Karen Meagher
Let S(n) be the symmetric group on n points. A subset S of S(n) is intersecting if for any pair of permutations π, σin S there is a point i in {1,...,n} such that π(i)=σ(i). Deza a…
math.CO2007
Covering arrays on graphs: qualitative independence graphs and extremal set partition theory
Karen Meagher
The main focus of this thesis is a generalization of covering arrays, covering arrays on graphs. Two vectors v,w in Z_k^n are qualitatively independent if for all ordered pairs (a,…