View More View Less
  • 1 Department of Mathematics Michigan State University 48824 East Lansing MI USA
Restricted access

We show that in almost every random graph process, the hitting time for havingk edge-disjoint spanning trees equals the hitting time for having minimum degreek.

Monthly Content Usage

Abstract Views Full Text Views PDF Downloads
Jun 2020 0 0 0
Jul 2020 0 0 0
Aug 2020 1 0 0
Sep 2020 0 0 0
Oct 2020 0 0 0
Nov 2020 0 0 0
Dec 2020 0 0 0