Gosselin, Shonda(Journal of Combinatorial Designs, 2011-02-17)
In this paper, we examine the possible orders of t-subset-regular selfcomplementary
k-uniform hypergraphs, which form examples of large sets
of two isomorphic t-designs. We reformulate Khosrovshahi and Tayfeh-
Rezaie's ...
For an integer n and a prime p, let n.p/ D maxfi V pi divides ng. In this paper, we present
a construction for vertex-transitive self-complementary k-uniform hypergraphs of order
n for each integer n such that pn.p/ 1 ...
In 2007, Szymanski and Wojda proved that for positive integers n; k with k<n, a self-complementary
k-uniform hypergraph of order n exists if and only if
n/k is even. In
this paper, we characterize the cycle type of a ...
Gosselin, Shonda(European Journal of Combinatorics, 2010-05)
A cyclically t-complementary k-hypergraph is a k-uniform hypergraph with vertex set V and edge set E for which there exists a permutation 2 Sym.V/ such that the sets E; E ; E 2; : : : ; E t1 partition the set of all ...
In this thesis, we survey the current research into self-complementary hypergraphs,
and present several new results.
We characterize the cycle type of the permutations on n elements with order equal
to a power of 2 which ...
Regular two-graphs are antipodal distance-regular double coverings of the
complete graph, and they have many interesting combinatorial properties.
We derive a construction for regular two-graphs containing cliques of ...