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

关于无限图中顺序兼容路径的研究

On order-compatible paths in infinite graphs

University of Hamburg(汉堡大学)

Max Pitz, Lucas Real, Roman Schaut

AI总结:

本文研究了无限图中顺序兼容路径的存在性,证明在路径长度有界的情况下,存在δ条边不相交且两两顺序兼容的路径,并探讨了其等价关系。

摘要:

在图G中,两个a−b路径被称为顺序兼容,如果它们的公共顶点在从a到b的旅行中出现相同的顺序。假设一个图包含无限多个边不相交的a−b路径δ。G.A. Dirac曾问是否总是存在一个由δ条边不相交的a−b路径组成的家族,这些路径两两之间都是顺序兼容的。确认了B. Zelinka的猜想,我们证明只要给定的δ条边不相交的a−b路径长度有界,则此结论成立。结合Zelinka之前的工作,可以得出Dirac的问题对于无限基数δ有肯定回答当且仅当δ具有不可数的协符性。作为我们的第二个主要结果,我们证明即使Dirac的问题失败,对于所有δ值,'通过δ条边不相交、两两顺序兼容的路径相连'仍然是一个等价关系。其中最有趣的情况是当δ为可数时。

英文摘要:

Two $a{-}b$ paths in a graph $G$ are order-compatible if their common vertices occur in the same order when travelling from $a$ to $b$. Suppose a graph contains an infinite number $δ$ of edge-disjoint $a{-}b$ paths. G.A. Dirac asked whether there always exists a family of $δ$ edge-disjoint $a{-}b$ paths that are pairwise order-compatible. Confirming a conjecture by B. Zelinka, we show that this holds provided that the given $δ$ edge-disjoint $a{-}b$ paths have bounded length. Combining this with an earlier work of Zelinka, it follows that Dirac's question for an infinite cardinal $δ$ has an affirmative answer if and only if $δ$ has uncountable cofinality. As our second main result, we show that even when Dirac's question fails, it still holds that 'being connected by $δ$ edge-disjoint, pairwise order-compatible paths' is an equivalence relation for all values of $δ$. The most interesting case here is when $δ$ is countable.

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

↑