arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.09643math.CO
收藏

连通Baranyai定理

Connected Baranyai's Theorem

Amin Bahmanian

摘要:

设$K_n^h=(V,\binom{V}{h})$是顶点集$V$上的完全$h$ -一致超图,其顶点集为$|V|=n$ . Baranyai证明$K_n^h$可以表示为边不相交的$r$ -正则因子的并集当且仅当$h$划分$rn$,$r$划分$\binom{n-1}{h-1}$。利用一种新的证明方法,证明了$λK_n^h$可以表示为$k$的边不相交因子的并集$\mathcal G_1\cup \ldots \cup\mathcal G_k$,其中对于$1\leq i\leq k$,$\mathcal G_i$是$r_i$ -正则的,当且仅当(i)$h$为$1\leq i\leq k$整除$r_in$,(ii)$\sum_{i=1}^k r_i=λ\binom{n-1}{h-1}$ .此外,对于任何$i$($1\leq i\leq k$),$r_i\geq 2$,这种新技术允许我们保证$\mathcal G_i$是连接的,推广Baranyai定理,并回答了Katona的问题。

英文摘要:

Let $K_n^h=(V,\binom{V}{h})$ 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 $rn$ and $r$ divides $\binom{n-1}{h-1}$. Using a new proof technique, in this paper we prove that $λK_n^h$ can be expressed as the union $\mathcal G_1\cup \ldots \cup\mathcal G_k$ of $k$ edge-disjoint factors, where for $1\leq i\leq k$, $\mathcal G_i$ is $r_i$-regular, if and only if (i) $h$ divides $r_in$ for $1\leq i\leq k$, and (ii) $\sum_{i=1}^k r_i=λ\binom{n-1}{h-1}$. Moreover, for any $i$ ($1\leq i\leq k$) for which $r_i\geq 2$, this new technique allows us to guarantee that $\mathcal G_i$ is connected, generalizing Baranyai's theorem, and answering a question by Katona.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑