A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints (Q1999736)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7074160
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints |
scientific article; zbMATH DE number 7074160 |
Statements
A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints (English)
0 references
27 June 2019
0 references
digraph
0 references
Turán problem
0 references
transitive tournament
0 references
walk
0 references
0 references
0.91801333
0 references
0.8973036
0 references
0.8962884
0 references
0.8897364
0 references
0.8773515
0 references
0.8741149
0 references
0.86749804
0 references
0.8654652
0 references
0.86518204
0 references
