Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints (Q2025066)
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: Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints |
scientific article; zbMATH DE number 7347229
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints |
scientific article; zbMATH DE number 7347229 |
Statements
Digraphs that contain at most \(t\) distinct walks of a given length with the same endpoints (English)
0 references
11 May 2021
0 references
Turán problem
0 references
digraph
0 references
walk
0 references
tournament
0 references
0 references
0 references
