Self-complementary hypergraphs

Adam Paweł Wojda
2006 Discussiones Mathematicae Graph Theory  
In the present paper, for every k, (1 ≤ k ≤ n), we give a characterization of self-complementig permutations of k-uniform self-complementary hypergraphs of the order n. This characterization implies the well known results for self-complementing permutations of graphs, given independently in the years 1962-1963 by Sachs and Ringel, and those obtained for 3-uniform hypergraphs by Kocay, for 4-uniform hypergraphs by Szymański, and for general (not uniform) hypergraphs by Zwonek.
doi:10.7151/dmgt.1314 fatcat:csxypnjuinbohjegqx66vsuj6a