Now showing items 1-4 of 4

    • Cyclically t-complementary uniform hypergraphs 

      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 t􀀀1 partition the set of all ...
    • Generating self-complementary uniform hypergraphs 

      Gosselin, Shonda (Discrete Mathematics, 2010-02)
      In 2007, Szymanski and Wojda proved that for positive integers n; k with k less than 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 ...
    • Self-Complementary Hypergraphs 

      Gosselin, Shonda (University of OttawaUniversity of Ottawa and Carleton University (joint program), 2009)
      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 ...
    • Vertex-transitive self-complementary uniform hypergraphs of prime order 

      Gosselin, Shonda (Discrete Mathematics, 2009-09)
      For an integer n and a prime p, let n(p)=max{i:pidividesn}. 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(mod2ℓ+1) ...