A Count Problem of Simplicial Complex in Euclidean Space
Yuyang Zhu · Journal of Hefei University · 2008
A popularization in the concept of planar graph and cycle will be carried out to yield the concept of planar complex.We prove that when m=3,the number of 3-dimension simplex is 3a0-10 for maximal planar complex K;the number of 2-dimension is 6a0-20 and the number of 1-dimension is 4a0-10.And we guess that when m≥2, the number of m-dimension simplex is m(a0-m-1)+2 for maximal planar complex K.