A lower bound for the number of orientable triangular embeddings of some complete graphs (Q965249)
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 lower bound for the number of orientable triangular embeddings of some complete graphs |
scientific article; zbMATH DE number 5696990
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the number of orientable triangular embeddings of some complete graphs |
scientific article; zbMATH DE number 5696990 |
Statements
A lower bound for the number of orientable triangular embeddings of some complete graphs (English)
0 references
21 April 2010
0 references
Steiner triple system
0 references
Latin square
0 references
complete graph
0 references
triangular embedding
0 references
0 references
0 references
0 references
0.9484453
0 references
0.92118686
0 references
0.9060114
0 references
0.9021462
0 references
0.8959882
0 references
0 references
0.8948884
0 references
0.8898327
0 references
0.8895545
0 references
