Connected Baranyai's theorem

Abstract: Let

be the complete

h

-uniform hypergraph on vertex set

V

with

| V | = n

. Baranyai showed that

K_{n}^{h}

can be expressed as the union of edge-disjoint

r

-regular factors if and only if

h

divides

r n

and

r

divides

. Using a new proof technique, in this paper we prove that

l a m b d a K_{n}^{h}

can be expressed as the union

m a t h c a l G_{1} c u p l d o t s c u p m a t h c a l G_{k}

of

k

edge-disjoint factors, where for

1 l e q i l e q k

,

m a t h c a l G_{i}

is

r_{i}

-regular, if and only if (i)

h

divides

r_{i} n

for

1 l e q i l e q k

, and (ii)

. Moreover, for any

i

(

1 l e q i l e q k

) for which

r_{i} g e q 2

, this new technique allows us to guarantee that

m a t h c a l G_{i}

is connected, generalizing Baranyai's theorem, and answering a question by Katona.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Connected Baranyai's theorem