论文信息 - Hitting time fork edge-disjoint spanning trees in a random graph - 字舞流文

Hitting time fork edge-disjoint spanning trees in a random graph

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.

E. M. Palmer | E. Palmer | J. J. Spencer | J. Spencer

[1] W. T. Tutte. On the Problem of Decomposing a Graph into n Connected Factors , 1961 .

[2] Béla Bollobás,et al. On matchings and hamiltonian cycles in random graphs Annals of Discrete Mathematics 28 , 1985 .

[3] C. Nash-Williams. Edge-disjoint spanning trees of finite graphs , 1961 .

[4] François Jaeger. A Note on Sub-Eulerian Graphs , 1979, J. Graph Theory.

[5] Paul A. Catlin,et al. A reduction method to find spanning Eulerian subgraphs , 1988, J. Graph Theory.

[6] Alan Frieze,et al. Edge disjoint spanning trees in random graphs , 1990 .

[7] B. Bollobás,et al. An algorithm for finding hamilton paths and cycles in random graphs , 1987 .

[8] Béla Bollobás,et al. Random Graphs , 1985 .