It is proved that the partition function of 3-dimensional simplicial g
ravity has an exponential upper bound with the following assumption: a
ny three dimensional sphere S-3 is constructed by repeated identificat
ion of neighboring links and neighboring triangles in the boundary of
a simplicial 3-ball. This assumption is weaker than that proposed by o
ther authors.