arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0704.0211math.CO
收藏

有向图的连通性与有序圈

Linkedness and ordered cycles in digraphs

Daniela Kühn, Deryk Osthus

摘要:

有向图D的最小半度是它的最小出度和最小入度中的最小者。证明了最小半度至少为n/2 +k-1的充分大有向图D是k-连通的.最小半度上的界是最好的,并且证实了Manoussakis在1990年提出的一个猜想。我们还确定了最小的最小半度,它确保了一个足够大的有向图D是k-序的,即对于D的每个k个不同顶点的有序序列,都有一个有向圈以这个顺序遇到这些顶点。

英文摘要:

The minimum semi-degree of a digraph D is the minimum of its minimum outdegree and its minimum indegree. We show that every sufficiently large digraph D with minimum semi-degree at least n/2 +k-1 is k-linked. The bound on the minimum semi-degree is best possible and confirms a conjecture of Manoussakis from 1990. We also determine the smallest minimum semi-degree which ensures that a sufficiently large digraph D is k-ordered, i.e. that for every ordered sequence of k distinct vertices of D there is a directed cycle which encounters these vertices in this order.

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

↑