A note of self-complementary hypergraphs

• Autorzy: Zwonek M.
• Języki publikacji: EN

Abstrakty

EN

In the paper we describe all self-complementary hypergraphs. It turns out that such hypergraphs exist if and only if the number of vertices of the hypergraph is of the form n = 2k. This answers a conjecture posed by A. Szymański (see[3]).

Słowa kluczowe

EN

self-complementary hypergraphs; complementing permutation

• Wydawca: AGH University of Science and Technology Press
• Czasopismo: Opuscula Mathematica
• Rocznik: 2005
• Tom: Vol. 25, no. 2
• Strony: 351--354
• Opis fizyczny: Bibliogr.3 poz.

Twórcy

autor

Zwonek M.

• AGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Kraków, Poland,

Bibliografia

• [1] Farrugia A.: Self-complementary graphs and generalisations: a comprehensive re­ference manual. University of Malta, 1999
• [2] Kocay W.: Reconstructed graphs as subsumed graphs of hypergraphs, and some self-complementary triple systems. Graphs and Combinatorics 8 (1992), 259-276
• [3] Szymański A.: Note on self-complementary 4-uniform hypergraphs. (Preprint)