摘要

We describe a general approach of determining the distribution of the number of certain types of spanning subgraphs in the random graph G(n, p). Using this approach, we reprove the distribution of the number of Hamilton cycles with a proof that is much shorter than previously known proofs. We also achieve new results on determining the distribution of the number of spanning triangle-free subgraphs and the number of triangle-factors.

  • 出版日期2013