Premium
On the minimal genus of 2‐complexes
Author(s) -
Mohar Bojan
Publication year - 1997
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199703)24:3<281::aid-jgt10>3.0.co;2-i
Subject(s) - subdivision , mathematics , combinatorics , genus , barycentric coordinate system , graph , euler's formula , euler characteristic , zoology , geometry , mathematical analysis , biology , geography , archaeology
Gross and Rosen asked if the genus of a 2‐dimensional complex K embeddable in some (orientable) surface is equal to the genus of the graph of appropriate barycentric subdivision of K . We answer the nonorientable genus and the Euler genus versions of Gross and Rosen's question in affirmative. We show that this is not the case for the orientable genus by proving that taking ⌊ log 2 g⌋ th barycentric subdivision is not sufficient, where g is the genus of K . On the other hand, (1+⌈log 2 ( g +2)⌉)th subdivision is proved to be sufficient. © 1997 John Wiley & Sons, Inc.