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

图中的2-因子

2-Factors in Graphs

London School of Economics & Political Science(伦敦政治经济学院);University of Southern Denmark(南丹麦大学)

Jan van den Heuvel, Bjarne Toft

AI总结:

本文探讨了图中2-因子的历史及理论,提供了一个直接的图论证明和新的2-因子定理变体,并给出了无2-因子的最大图的完整特征。

摘要:

本文综述了图中2-因子的历史及理论,提供了2-因子定理的直接图论证明和其新变体,并给出了无2-因子的最大图的完整特征。这基于Tibor Gallai关于1-因子和Hans-Boris Belck关于k-因子的重要工作,两者均于1950年发表,并独立包含交替链的理论。我们还证明了一个(2k+1)-正则图若有至多2k个叶节点则存在2-因子,并描述了所有连通的(2k+1)-正则图若恰好有2k+1个叶节点而无2-因子的情况。这扩展了Julius Petersen著名的定理,即任何3-正则图若有至多两个叶节点则存在1-因子,也扩展了Sylvester为该定理发现的极值图。

英文摘要:

An account of 2-factors in graphs and their history is presented. We give a direct graph-theoretic proof of the 2-Factor Theorem and a new variant of it, and also a new complete characterisation of the maximal graphs without 2-factors. This is based on the important works of Tibor Gallai on 1-factors and of Hans-Boris Belck on k-factors, both published in 1950 and independently containing the theory of alternating chains. We also present an easy proof that a $(2k+1)$-regular graph with at most $2k$ leaves has a 2-factor, and we describe all connected $(2k+1)$-regular graphs with exactly $2k+1$ leaves without a 2-factor. This generalises Julius Petersen's famous theorem, that any 3-regular graph with at most two leaves has a 1-factor, and it generalises the extremal graphs Sylvester discovered for that theorem.

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

↑