Constructing Regular Self-complementary Uniform Hypergraphs

WinnSpace/Manakin Repository

Constructing Regular Self-complementary Uniform Hypergraphs

Show simple item record

dc.contributor.author Gosselin, Shonda
dc.date.accessioned 2011-07-07T19:05:57Z
dc.date.available 2011-07-07T19:05:57Z
dc.date.issued 2011-02-17
dc.identifier.citation Early View (Online Version of Record published before inclusion in an issue) en_US
dc.identifier.uri http://hdl.handle.net/10680/393
dc.description AMS Subject Classication Codes: 05C65, 05B05 05E20, 05C85. en_US
dc.description.abstract 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 necessary conditions on the order of these structures in terms of the binary representation of the rank k, and these conditions simplify to a more transparent relation between the order n and rank k in the case where k is a sum of consecutive powers of 2. Moreover, we present new constructions for 1-subset-regular self-complementary uniform hypergraphs, and prove that these necessary conditions are su cient for all k, in the case where t = 1. en_US
dc.language.iso en en_US
dc.publisher Journal of Combinatorial Designs en_US
dc.subject Self-complementary hypergraph en_US
dc.subject Regular hypergraph en_US
dc.subject Complementing permutation en_US
dc.subject Large set of t-designs en_US
dc.title Constructing Regular Self-complementary Uniform Hypergraphs en_US
dc.type Article en_US
dc.type Research Paper

Files in this item

Files Size Format View Description
RegSCuniformHyp.pdf 282.4Kb PDF View/Open pre-refereed pre-print

This item appears in the following Collection(s)

Show simple item record

Search WinnSpace


Advanced Search

Browse

My Account