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 the normal view instead:
scientific article; zbMATH DE number 4023319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycles of length 0 modulo k in directed graphs |
scientific article; zbMATH DE number 4023319 |
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
0 references
0.8551452159881592
0 references
0.8301235437393188
0 references
0.8290234208106995
0 references
0.8278923630714417
0 references
0.8260248899459839
0 references
