Abstract
We show that every digraph D with minimum outdegree δ and maximum indegree Δ contains a directed cycle of length 0(mod k), provided e[Δd + 1](1 - 1 k)δ < 1. In particular, if Δ < (2δ - e) eδ the D contains an even cycle.
Original language | English (US) |
---|---|
Pages (from-to) | 114-119 |
Number of pages | 6 |
Journal | Journal of Combinatorial Theory, Series B |
Volume | 47 |
Issue number | 1 |
DOIs | |
State | Published - Aug 1989 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics