Cheeger inequality is a classical result emerging from the isoperimetric problem in the field of geometry. In the graph theory, a discrete version of Cheeger inequality was also studied deeply and the notion was further extended for higher dimensional simplicial complexes in various directions. In this paper, we consider an analogue of discrete Cheeger inequality for high dimensional simplicial complexes from a combinatorial viewpoint.