Upper bounds on the size of transitive subtournaments in digraphs (Q2013188)
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 6756331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds on the size of transitive subtournaments in digraphs |
scientific article; zbMATH DE number 6756331 |
Statements
Upper bounds on the size of transitive subtournaments in digraphs (English)
0 references
3 August 2017
0 references
transitive subtournament
0 references
regular digraph
0 references
doubly regular tournament
0 references
Paley tournament
0 references
Hoffman's bound
0 references
block intersection polynomial
0 references
0 references
0.7653758525848389
0 references
0.7371588945388794
0 references
0.7364742755889893
0 references
0.7299628257751465
0 references
