Extremal digraphs avoiding distinct walks of length 3 with the same endpoints (Q2144591)
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: Extremal digraphs avoiding distinct walks of length 3 with the same endpoints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extremal digraphs avoiding distinct walks of length 3 with the same endpoints |
scientific article |
Statements
Extremal digraphs avoiding distinct walks of length 3 with the same endpoints (English)
0 references
14 June 2022
0 references
digraph
0 references
Turán problem
0 references
walk
0 references
0 references
0.9151612520217896
0 references
0.9129536747932434
0 references
0.9046883583068848
0 references
0.8788961172103882
0 references
0.8424859642982483
0 references
