- Tytuł:
- Self-complementary hypergraphs
- Autorzy:
- Wojda, A.
- Powiązania:
- https://bibliotekanauki.pl/articles/743928.pdf
- Data publikacji:
- 2006
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
k-uniform hypergraph
self-complementary hypergraph - Opis:
-
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; \binom{V}{k} - E)$.
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. - Źródło:
-
Discussiones Mathematicae Graph Theory; 2006, 26, 2; 217-224
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł