Almost Self-Complementary Uniform Hypergraphs
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)$\left({\matrix{ n \cr k \cr } } \right)$ is od...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2018-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2028 |
_version_ | 1797704406299312128 |
---|---|
author | Wojda Adam Paweł |
author_facet | Wojda Adam Paweł |
author_sort | Wojda Adam Paweł |
collection | DOAJ |
description | 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)$\left({\matrix{ n \cr k \cr } } \right)$ is odd. |
first_indexed | 2024-03-12T05:19:54Z |
format | Article |
id | doaj.art-9134cd73db5f4dc6afb77857c77e2806 |
institution | Directory Open Access Journal |
issn | 2083-5892 |
language | English |
last_indexed | 2024-03-12T05:19:54Z |
publishDate | 2018-05-01 |
publisher | University of Zielona Góra |
record_format | Article |
series | Discussiones Mathematicae Graph Theory |
spelling | doaj.art-9134cd73db5f4dc6afb77857c77e28062023-09-03T07:47:22ZengUniversity of Zielona GóraDiscussiones Mathematicae Graph Theory2083-58922018-05-0138260761010.7151/dmgt.2028dmgt.2028Almost Self-Complementary Uniform HypergraphsWojda Adam Paweł0AGH University of Science and Technology, Faculty of Applied Mathematics, Al. Mickiewicza 30, 30-059Kraków, PolandA 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)$\left({\matrix{ n \cr k \cr } } \right)$ is odd.https://doi.org/10.7151/dmgt.2028uniform hypergraph035c |
spellingShingle | Wojda Adam Paweł Almost Self-Complementary Uniform Hypergraphs Discussiones Mathematicae Graph Theory uniform hypergraph 035c |
title | Almost Self-Complementary Uniform Hypergraphs |
title_full | Almost Self-Complementary Uniform Hypergraphs |
title_fullStr | Almost Self-Complementary Uniform Hypergraphs |
title_full_unstemmed | Almost Self-Complementary Uniform Hypergraphs |
title_short | Almost Self-Complementary Uniform Hypergraphs |
title_sort | almost self complementary uniform hypergraphs |
topic | uniform hypergraph 035c |
url | https://doi.org/10.7151/dmgt.2028 |
work_keys_str_mv | AT wojdaadampaweł almostselfcomplementaryuniformhypergraphs |