A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints (Q2115146)
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: A note on extremal digraphs containing at most t walks of length k with the same endpoints |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints |
scientific article |
Statements
A note on extremal digraphs containing at most \(t\) walks of length \(k\) with the same endpoints (English)
0 references
15 March 2022
0 references
digraph
0 references
Turán problem
0 references
walk
0 references
0 references
0 references
0.9497226476669312
0 references
0.8848616480827332
0 references
0.8583313822746277
0 references
0.8540559411048889
0 references
0.8508765697479248
0 references
