Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Opuscula Mathematica

2 2005

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: complementing permutation

Sortuj według:

Ogranicz wyniki do:

A note on self-complementary 4-uniform hypergraphs

Szymański A.

Opuscula Mathematica

2005

Vol. 25, no. 2

319-323

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 self-complementary hypergraph.

A note of self-complementary hypergraphs

Zwonek M.

Opuscula Mathematica

2005

Vol. 25, no. 2

351-354

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]).