How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? (Q1961765)
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 1394580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? |
scientific article; zbMATH DE number 1394580 |
Statements
How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity? (English)
0 references
5 July 2000
0 references
semicomplete multipartite digraph
0 references
irregularity
0 references
Hamiltonian
0 references
tournaments
0 references
0.8636460900306702
0 references
0.8635984063148499
0 references
0.8635984063148499
0 references
0.8455023765563965
0 references
