Name
Abstract | ||
|---|---|---|
We prove that the sum of two random trees possesses with high probability a perfect matching and the sum of five random trees possesses with high probability a Hamilton cycle. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1137/S0895480196313790 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
random trees,high probability,perfect matching,hamiltonian cycles,perfect matchings,hamilton cycle,hamilton cycles,hamiltonian cycle,random tree | Graph theory,Random tree,Discrete mathematics,Combinatorics,Hamiltonian path,Matching (graph theory),Mathematics,Random function | Journal |
Volume | Issue | ISSN |
12 | 2 | 0895-4801 |
Citations | PageRank | References |
3 | 0.56 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan M. Frieze | 1 | 4837 | 787.00 |
| Michal Karonski | 2 | 120 | 12.09 |
| Lubos Thoma | 3 | 42 | 5.34 |