Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture (Q1356730)
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: Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture |
scientific article; zbMATH DE number 1019086
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture |
scientific article; zbMATH DE number 1019086 |
Statements
Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture (English)
0 references
7 October 1997
0 references
L. Caccetta and R. Häggkvist conjectured that in a digraph \(D\) on \(n\) vertices, the girth of \(D\) is at most \(\lfloor n/d\rfloor\), if each vertex is of out-degree at least \(d\). The paper discusses the case where \(d=\lceil n/3\rceil\).
0 references
digraph
0 references
girth
0 references
0 references
