 
Summary: Mathematics
and
Statistics
COLLOQUIUM
Shonda Gosselin
University of Winnipeg
Cyclic Decompositions of
Complete Uniform
Hypergraphs
Friday, February 4, 2011
3:30 p.m.
Mathematics and Statistics Lounge, CW 307.20
Abstract: A cyclic tpartition of a hypergraph with vertex set V is a decom
position of the hypergraph into t isomorphic hypergraphs which are permuted
cyclically by a permutation of V . We obtain necessary and sufficient conditions
on n for the existence of a cyclic tpartition of a complete kuniform hypergraph
with n vertices, and an algorithm for generating all such partitions up to iso
morphism, for feasible n. As an application of this result, we construct cyclic
partitions of complete multipartite hypergraphs. We also look at a hypergraph
construction which is derived from the well known Paley graph construction.
