3- regular self-complementary 6- hypergraphs

3- regular self-complementary 6- hypergraphs

A k-hypergraph with vertex set V and edge set E is called t-regular if every t-element subset of V lies in the same number of elements of E. In this note, we prove the existence of a new family of 3-regular self-complementary k-hypergraphs for k=6.

[1] Ajoodani-namini S. and Khosrovshahi G.B. (1994). More on halving the complete designs, Discrete Math., 135, 29–37. [2] Alltop W. O. (1975). Extending t-designs, J. Combin. Theory Ser., A, 18, 177–186. [3] Ariannejad M., Emami M. and Naserian O. Some infinite families of t-regular self-complementary k-hypergraphs, submitted. [4] Gosselin S. (2011). Constructing regular self-complementary uniform hypergraphs, J. Combin. Des., 19, 439–454. [5] Khosrovshahi G.B. and Laue R. (2007). t-Designs, t ≤ 3 , in: Handbook of combinatorial designs, 2nd ed. (Colbourn C.J. and Dinitz J.H., eds.) CRC press, Boca Raton, 98–110. [6] Khosrovshahi G.B. and Tayfeh-Rezaie B. (2003). Root case of large sets of t-designs, Discrete Math., 263, 143–155. [7] Khosrovshahi G.B. and Tayfeh-Rezaie B. (2006). Large sets of t-designs through partitionable sets: A survey, Discrete Math., 306, 2993–3004. [8] Knor M. and Potočnik P. (2013). A note on 2-subset-regular self-complementary 3-uniform hypergraphs, Ars Comb., 111, 33–36. [9] Potočnik P. and Šajna M. (2009). The existence of regular self-complementary 3-uniform hypergraphs, Discrete Math., 309, 950–954. [10] Rao S. B. (1985). On regular and strongly-regular self-complementary graphs, Discrete Math., 54, 73–82. [11] Wilson M. (1975). Decomposition of complete graphs into subgraphs isomophic to a given graph, Congressus Numerantium XV, 647–659.