Vertex-transitive self-complementary uniform hypergraphs of prime order

DOI10.1016/j.disc.2009.08.011zbMath1213.05187OpenAlexW2038755312MaRDI QIDQ965936

Shonda Gosselin

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.08.011

zbMATH Keywords

uniform hypergraphself-complementary hypergraphcomplementing permutationtransitive hypergraphlarge set of \(t\)-designs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (4)

Self-complementary non-uniform hypergraphs ⋮ Extending Potočnik and Šajna's conditions on the existence of vertex-transitive self-complementary \(k\)-hypergraphs ⋮ Permutation Groups Containing a Regular Abelian Hall Subgroup ⋮ Ample simplicial complexes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-trivial \(t\)-designs without repeated blocks exist for all \(t\)
• Reconstructing graphs as subsumed graphs of hypergraphs, and some self- complementary triple systems
• Root cases of large sets of \(t\)-designs
• On regular and strongly-regular self-complementary graphs
• Vertex-transitive self-complementary uniform hypergraphs
• On groups of odd prime-power degree that contain a full cycle
• All self-complementary symmetric graphs

This page was built for publication: Vertex-transitive self-complementary uniform hypergraphs of prime order