There is no triangulation of the torus with vertex degrees 5, 6, , 6, 7 and related results: geometric proofs for combinatorial theorems

From MaRDI portal
Publication:376287

DOI10.1007/S10711-012-9782-5zbMATH Open1275.05015arXiv1207.3605OpenAlexW2120259233MaRDI QIDQ376287FDOQ376287


Authors: Ivan Izmestiev, Robert B. Kusner, Günter Rote, John M. Sullivan, Boris A. Springborn Edit this on Wikidata


Publication date: 4 November 2013

Published in: Geometriae Dedicata (Search for Journal in Brave)

Abstract: There is no 5,7-triangulation of the torus, that is, no triangulation with exactly two exceptional vertices, of degree 5 and 7. Similarly, there is no 3,5-quadrangulation. The vertices of a 2,4-hexangulation of the torus cannot be bicolored. Similar statements hold for 4,8-triangulations and 2,6-quadrangulations. We prove these results, of which the first two are known and the others seem to be new, as corollaries of a theorem on the holonomy group of a euclidean cone metric on the torus with just two cone points. We provide two proofs of this theorem: One argument is metric in nature, the other relies on the induced conformal structure and proceeds by invoking the residue theorem. Similar methods can be used to prove a theorem of Dress on infinite triangulations of the plane with exactly two irregular vertices. The non-existence results for torus decompositions provide infinite families of graphs which cannot be embedded in the torus.


Full work available at URL: https://arxiv.org/abs/1207.3605




Recommendations




Cites Work


Cited In (4)





This page was built for publication: There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q376287)