论文信息 - Edge disjoint spanning trees in random graphs - 字舞流文

Edge disjoint spanning trees in random graphs

We show that almost everyGm-out containsm edge disjoint spanning trees.

Alan Frieze | A. Frieze | Tomasz Łuczak | Tomasz Łuczak

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

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

[3] A. Frieze,et al. On the connectivity of randomm-orientable graphs and digraphs , 1982 .

[4] Alan M. Frieze. Maximum matchings in a class of random graphs , 1986, J. Comb. Theory, Ser. B.

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