A note on self-complementary 4-uniform hypergraphs
Titel:
A note on self-complementary 4-uniform hypergraphs
Auteur:
Artur SzymaĆski
Verschenen in:
Opuscula mathematica
Paginering:
Jaargang 25 (2005) nr. 2 pagina's 319-323
Jaar:
2005
Inhoud:
We prove that a permutation $\theta$ is complementing permutation for a 4-uniform hypergraph if and only if one of the following cases is satisfied: (i) the length of every cycle of $\theta$ is a multiple of 8, (ii) $\theta$ has 1, 2 or 3 fixed points, and all other cycles have length a multiple of 8, (iii) $\theta$ has 1 cycle of length 2, and all other cycles have length a multiple of 8, (iv) $\theta$ has 1 fixed point, 1 cycle of length 2, and all other cycles have length a multiple of 8, (v) $\theta$ has 1 cycle of length 3, and all other cycles have length a multiple of 8. Moreover, we present algorithms for generating every possible 3 and 4-uniform selfcomplementary hypergraphs.
Uitgever:
AGH University of Science and Technology (provided by DOAJ)