Self-complementary hypergraphs

Abstract

A k-uniform hypergraph H = (V;E) is called self-complementary if there is a permutation σ: V → V, called self-complementing, such that for every k-subset e of V, e ∈ E if and only if σ(e) / ∈ E. In other words, H is isomorphic with H ′ = (V; V