A note on the number of edges in a Hamiltonian graph with no repeated cycle length (Q4595658)
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 the number of edges in a Hamiltonian graph with no repeated cycle length |
scientific article; zbMATH DE number 6815663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the number of edges in a Hamiltonian graph with no repeated cycle length |
scientific article; zbMATH DE number 6815663 |
Statements
6 December 2017
0 references
maximum number of edges
0 references
0.8180076479911804
0 references
0.8128128051757812
0 references
0.8114342093467712
0 references
