Note on the regular digraphs (Q1063622)
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: Note on the regular digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on the regular digraphs |
scientific article |
Statements
Note on the regular digraphs (English)
0 references
1985
0 references
If g(r,n) is the minimum number of vertices in an r-regular digraph having girth n, we have the conjecture: \(r\geq 1\), \(n\geq 2\), \(g(r,n)=r(n- 1)+1\). The author gives two sufficient conditions in which this conjecture is true. One of them is: \(r)\lfloor n/2\rfloor -1)<n.\)
0 references
regular digraph
0 references
girth
0 references
