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

关于笼图的一个猜想的证明

The proof of a conjecture about cages

Xiang-Feng Pan, Jing-Zhong Mao, Hui-Qing Liu

AI总结:

该研究针对Jiang和Mubayi提出的“$(k; g)$-笼图中所有长度为$g$的环均为非分离环”的猜想,在已有偶数围长证明的基础上,完成了奇数围长情形的证明,使该猜想得到完整证实。

摘要:

图的围长定义为图中最短环的长度。$(k; g)$-笼图是指所有围长为$g$的$k$-正则图中阶数最小的图。若图$G$去掉环$C$的顶点集$V(C)$后仍保持连通,则称环$C$为非分离环。T. Jiang与D. Mubayi在《Connectivity and Separating Sets of Cages》(发表于《J. Graph Theory》1998年第29卷第1期35-44页)中提出一个猜想:$(k; g)$-笼图中所有长度为$g$的环都是非分离环。该猜想在上述文献中已对偶数$g$的情形得到证明,本文则证明该猜想对奇数$g$同样成立,至此该猜想被完全证明。

英文摘要:

The girth of a graph is defined as the length of a shortest cycle in the graph. A $(k; g)$-cage is a graph of minimum order among all $k$-regular graphs with girth $g$. A cycle $C$ in a graph $G$ is termed nonseparating if the graph $G-V(C)$ remains connected. A conjecture, proposed in [T. Jiang, D. Mubayi. Connectivity and Separating Sets of Cages. J. Graph Theory 29(1)(1998) 35--44], posits that every cycle of length $g$ within a $(k; g)$-cage is nonseparating. While the conjecture has been proven for even $g$ in the aforementioned work, this paper presents a proof demonstrating that the conjecture holds true for odd $g$ as well. Thus, the previously mentioned conjecture was proven to be true.

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

↑