Generating self-complementary uniform hypergraphs

WinnSpace/Manakin Repository

Generating self-complementary uniform hypergraphs

Show full item record

Title: Generating self-complementary uniform hypergraphs
Author: Gosselin, Shonda
Abstract: 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 k-complementing permutation in Sym.n/ which has order equal to a power of 2. This yields a test for determining whether a finite permutation is a k-complementing permutation, and an algorithm for generating all self-complementary k-hypergraphs of order n, up to isomorphism, for feasible n.We also obtain an alternative description of the necessary and sufficient conditions on the order of a self-complementary k-uniform hypergraph, in terms of the binary representation of k. This extends previous results for the cases k D 2; 3; 4 due to Ringel, Sachs, Suprunenko, Kocay and Szymanski.
URI: http://hdl.handle.net/10680/294
Date: 2010-02

Files in this item

Files Size Format View Description
GenSCHyp FINAL.pdf 602.4Kb PDF View/Open [Main Article] This is an author-produced, peer-reviewed article that has been accepted for publication in Discrete Mathematics, but has not been copyedited.

This item appears in the following Collection(s)

Show full item record

Search WinnSpace


Advanced Search

Browse

My Account