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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call