Almost Self-Complementary Uniform Hypergraphs
Discussiones Mathematicae. Graph Theory, Tome 38 (2018) no. 2, pp. 607-610
Voir la notice de l'article provenant de la source Library of Science
A k-uniform hypergraph (k-hypergraph) is almost self-complementary if it is isomorphic with its complement in the complete k-uniform hypergraph minus one edge. We prove that an almost self-complementary k-hypergraph of order n exists if and only if nk is odd.
Keywords:
uniform hypergraph
@article{DMGT_2018_38_2_a18,
author = {Wojda, Adam Pawe{\l}},
title = {Almost {Self-Complementary} {Uniform} {Hypergraphs}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {607--610},
publisher = {mathdoc},
volume = {38},
number = {2},
year = {2018},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2018_38_2_a18/}
}
Wojda, Adam Paweł. Almost Self-Complementary Uniform Hypergraphs. Discussiones Mathematicae. Graph Theory, Tome 38 (2018) no. 2, pp. 607-610. http://geodesic.mathdoc.fr/item/DMGT_2018_38_2_a18/