Abstract: In this paper, we present an asymptotic formula for and obtain bounds for Furthermore,
we conjecture that thesequence is a unimodal sequence.
Finally, we give a combinatorial identity on two kinds of Stirling numbers by
means of enumeration of 1-factor of a graph without subgraphs.
Keywords and phrases: component, unimodality,
Stirling numbers,
