Cycles of length 0 modulo k in directed graphs (Q1093650)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Cycles of length 0 modulo k in directed graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cycles of length 0 modulo k in directed graphs |
scientific article |
Statements
Cycles of length 0 modulo k in directed graphs (English)
0 references
1989
0 references
We show that every digraph D with minimum outdegree \(\delta\) and maximum indegree \(\Delta\) contains a directed cycle of length 0(mod k), provided \(e(\Delta \delta +1)(1-1/k)^{\delta}<1\). In particular, if \(\Delta <(2^{\delta}-e)/e\delta\) then D contains an even cycle.
0 references
regular digraphs
0 references
directed cycle
0 references
