On the number of coloured triangulations of d-manifolds

From MaRDI portal
Publication:2664103



Abstract: We give superexponential lower and upper bounds on the number of coloured d-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and dgeq3 is fixed. In the special case of dimension 3, the lower and upper bounds match up to exponential factors, and we show that there are 2O(n)nfracn6 coloured triangulations of 3-manifolds with n tetrahedra. Our results also imply that random coloured triangulations of 3-manifolds have a sublinear number of vertices. Our upper bounds apply in particular to coloured d-spheres for which they seem to be the best known bounds in any dimension dgeq3, even though it is often conjectured that exponential bounds hold in this case. We also ask a related question on regular edge-coloured graphs having the property that each 3-coloured component is planar, which is of independent interest.












This page was built for publication: On the number of coloured triangulations of \(d\)-manifolds

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