The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.
Instituto de Matemáticas Universidad Nacional Autónoma de México CU, México D.F. 04510
Bibliografia
[1] R. Blind and P. Mani-Levitska, Puzzles and polytope isomorphisms, Aequationes Math. 34 (1987) 287-297. doi:10.1007/BF01830678[Crossref]
[2] G. Kalai, A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49 (1988) 381-383. doi:10.1016/0097-3165(88)90064-7[Crossref]
[3] B. Mohar and A. Vodopivec, On polyhedral embeddings of cubic graphs, Combin. Probab. Comput. 15 (2006) 877-893. doi:10.1017/S0963548306007607[Crossref]
[4] G.M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, Springer, (1995). doi:10.1007/978-1-4613-8431-1[Crossref]