Most of my research is focused on the Erdos-Ko-Rado theorem. This involves generaliztions and extensions of this theorem using a variety of methods. I am also interested in design theory, including constructions and bounds of covering arrays. I work on extremal set theory and I am interested in extensions of results in extremal set theory to partitions and permutations. I have worked on applying methods from algebraic graph theory to design theory problems. Finally I am interested in computational aspects of discrete math such as applications of covering arrays, industrial scheduling and software testing
