Short cycles in directed graphs (Q797594)
From MaRDI portal
!
WARNING
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 3867367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Short cycles in directed graphs |
scientific article; zbMATH DE number 3867367 |
Statements
Short cycles in directed graphs (English)
0 references
1983
0 references
The authors prove, by an inductive argument, that every directed graph with n vertices and minimum outdegree k contains a directed cycle of length at most \(n/K+2500.\)
0 references
cycle length
0 references
minimum outdegree
0 references
directed cycle
0 references
