完全多重图PDMATHAAB对每个$λ\leq 2n$的不可分解$1$ -因子分解
Indecomposable $1$-factorizations of the complete multigraph $λK_{2n}$ for every $λ\leq 2n$
摘要:
完全多重图$λK_{2n}$的$1$ -因子分解称为不可分解的,如果它不能表示为$λ_0 K_{2n}$和$(λ-λ_0) K_{2n}$的$1$ -因子分解的并集,其中$λ_0<λ$ .如果不重复$1$ -因子,则称其为简单。对于每个$n\geq 9$和每个$(n-2)/3\leqλ\leq 2n$,我们构造了$λK_{2n}$的一个不可分解的$1$ -因子分解.这些$1$ -因子分解为每个$s\geq 18$和$2\leqλ\leq 2\lfloor s/2\rfloor-1$提供了$λK_{2s}$的简单且不可分解的$1$ -因子分解.我们还推广了Colbourn等人的一个结果,给出了$λK_{2n}$的一个简单的不可分解的$1$ -因子分解,其中$2n=p^m+1$,$λ=(p^m-1)/2$,$p$是素数.
英文摘要:
A $1$-factorization of the complete multigraph $λK_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $λ_0 K_{2n}$ and $(λ-λ_0) K_{2n}$, where $λ_0<λ$. It is said to be simple if no $1$-factor is repeated. For every $n\geq 9$ and for every $(n-2)/3\leqλ\leq 2n$, we construct an indecomposable $1$-factorization of $λK_{2n}$ which is not simple. These $1$-factorizations provide simple and indecomposable $1$-factorizations of $λK_{2s}$ for every $s\geq 18$ and $2\leqλ\leq 2\lfloor s/2\rfloor-1$. We also give a generalization of a result by Colbourn et al. which provides a simple and indecomposable $1$-factorization of $λK_{2n}$, where $2n=p^m+1$, $λ=(p^m-1)/2$, $p$ prime.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。