Genus bounds for embeddings with large minimum degree and representativity (Q1598852)
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 1746285
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Genus bounds for embeddings with large minimum degree and representativity |
scientific article; zbMATH DE number 1746285 |
Statements
Genus bounds for embeddings with large minimum degree and representativity (English)
0 references
28 May 2002
0 references
The authors establish some inequalities involving the minimum degree, the representativity, and the genus of a graph on a surface. In particular, if the minimum degree is at least \(7\), then the representativity is bounded above by the logarithm of the genus.
0 references
0.7926265597343445
0 references
0.7815018892288208
0 references
0.7815018892288208
0 references
0.7727457284927368
0 references
