Constructing regular self-complementary uniform hypergraphs

DOI10.1002/jcd.20286zbMath1242.05191MaRDI QIDQ2896012

Shonda Gosselin

Publication date: 13 July 2012

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10680/393

zbMATH Keywords

regular hypergraph; self-complementary hypergraph; complementing permutation; large set of \(t\)-designs

Mathematics Subject Classification ID

05B05: Combinatorial aspects of block designs

05C65: Hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Almost self-complementary 3-uniform hypergraphs, Some infinite families of \(t\)-regular self-complementary \(k\)-hypergraphs, Self-complementary non-uniform hypergraphs, Some new families of 3-regular self-complementary \(k\)-hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of 2-designs Slambda(2,3,v) without repeated blocks
• Combining \(t\)-designs
• Extending t-designs
• More on halving the complete designs
• All block designs with \(b={v\choose k}/2\) exist
• Locally trivial t-designs and t-designs without repeated blocks
• Root cases of large sets of \(t\)-designs
• On regular and strongly-regular self-complementary graphs
• Vertex-transitive self-complementary uniform hypergraphs
• A note on 2-subset-regular self-complementary 3-uniform hypergraphs
• A New Basis for Trades