arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.3890math.CO
收藏

Mariusz Meszka问题的推广

A generalization of the problem of Mariusz Meszka

Anita Pasotti, Marco Antonio Pellegrini

摘要:

Mariusz Meszka证明了:给定素数p=2n+1和包含n个不超过n的正整数的列表L,在K_p中存在一个近1-因子,其边长列表为L。在本文中,我们提出了一个推广的情况下,其中p是一个奇数不一定是素数这个问题。特别地,我们给出了一个必要条件的存在这样一个近1-因子的任何奇数p。我们表明,这个条件也是充分的任何列表L的基础集S的大小为1,2,或n。证明了如果对任意与完全图的阶p不互质的正整数t,S={1,2,t},则猜想成立.当t和p互质时,我们也给出了部分结果.最后,我们给出了t<12的完整解。

英文摘要:

Mariusz Meszka has conjectured that given a prime p=2n+1 and a list L containing n positive integers not exceeding n there exists a near 1-factor in K_p whose list of edge-lengths is L. In this paper we propose a generalization of this problem to the case in which p is an odd integer not necessarily prime. In particular, we give a necessary condition for the existence of such a near 1-factor for any odd integer p. We show that this condition is also sufficient for any list L whose underlying set S has size 1, 2, or n. Then we prove that the conjecture is true if S={1,2,t} for any positive integer t not coprime with the order p of the complete graph. Also, we give partial results when t and p are coprime. Finally, we present a complete solution for t<12.

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

↑