Short cycles in digraphs (Q1112060): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4192089 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Short cycles in directed graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on the girth of digraphs / rank | |||
Normal rank | |||
Latest revision as of 10:03, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short cycles in digraphs |
scientific article |
Statements
Short cycles in digraphs (English)
0 references
1988
0 references
The main result of this paper is: If G is a digraph with n vertices such that each vertex of G has outdegree at least k (k\(\geq 2)\), then G has a cycle of length at most \((n/k)+304.\) This theorem is an improvement of the result of \textit{V. Chvátal} and \textit{E. Szemerédi} [J. Comb. Theory, Ser. B 35, 323-327 (1983; Zbl 0545.05038)] in which 304 is replaced by 2500.
0 references
cycles in digraphs
0 references
