Constructing regular self-complementary uniform hypergraphs

Autor: Shonda Gosselin
Rok vydání: 2011
Předmět:
Zdroj: Journal of Combinatorial Designs. 19:439-454
ISSN: 1063-8539
DOI: 10.1002/jcd.20286
Popis: AMS Subject Classication Codes: 05C65, 05B05 05E20, 05C85. In this paper, we examine the possible orders of t-subset-regular self-complementary 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 sufficient for all k, in the case where t = 1. https://onlinelibrary.wiley.com/doi/abs/10.1002/jcd.20286
Databáze: OpenAIRE