Genus bounds for embeddings with large minimum degree and representativity (Q1598852): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 06:03, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Genus bounds for embeddings with large minimum degree and representativity |
scientific article |
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