Linkedness and ordered cycles in digraphs
| dc.creator | Kühn, Daniela | |
| dc.creator | Osthus, Deryk | |
| dc.date | 2007-04-02 | |
| dc.date.accessioned | 2026-07-07T07:54:23Z | |
| dc.date.available | 2026-07-07T07:54:23Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0704.0211 | |
| dc.identifier | http://arxiv.org/abs/0704.0211 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/126589 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C20; 05C35; 05C40 | |
| dc.title | Linkedness and ordered cycles in digraphs | |
| dc.type | text |