On perfect matchings and Hamilton cycles in sums of random trees

SIAM Journal on Discrete Mathematics

Volumn 12, Issue 2, 1999, Pages 208-216

  Frieze, Alan ^a   Karoński, Michal ^b,c   Thoma, Luboš ^d  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b EMORY UNIVERSITY   (United States)

^c ADAM MICKIEWICZ UNIVERSITY   (Poland)

^d RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

HAMILTON CYCLE; RANDOM TREES;

TREES (MATHEMATICS);

EID: 0344671558     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480196313790     Document Type: Article

References (12)

1. E. A. BENDER AND S. G. WILLIAMSON, Foundations of Applied Combinatorics, Addison-Wesley, Reading, MA, 1991.
2. C. COOPER AND A. M. FRIEZE, Hamilton cycles in random graphs and directed graphs, to appear.
3. J. EDMONDS, Paths, Trees, and Flowers, Canad. J. Math., 17 (1965), pp. 449-467.
4. A. M. FRIEZE, Maximum matchings in a class of random graphs, J. Combin. Theory Ser. B, 40 (1986), pp. 196-212.
5. A. M. FRIEZE AND T. ŁUCZAK, Hamiltonian cycles in a class of random graphs: One step further, in Random Graphs '87, M. Karonski, J. Jaworski, and A. Rucinski, eds., John Wiley, Chichester, 1990, pp. 53-59.
6. T. GALLAI, Über extreme Punkt- und Kantenmengen, Ann. Univ. Sci. Budapest Eötvös Sect. Math., 2 (1959), pp. 133-138.
7. V. F. KOLCHIN, Random Mappings, Optimization Software Inc., New York, 1986.
8. A. MEIR AND J. W. MOON, The expected node-independence number of random trees, Nederl. Akad. Wetensch. Proc. Ser. Indag. Math., 35 (1974), pp. 335-341.
9. E. SCHMUTZ, private communication.
10. E. SCHMUTZ, Matchings in superpositions of (n, n)-bipartite trees, Random Structures Algorithms, 5 (1994), pp. 235-241.
11. E. SHAMIR AND E. UPFAL, One-factor in random graphs based on vertex choice, Discrete Math., 41 (1982), pp. 281-286.
12. D. W. WALKUP, Matchings in random regular bipartite digraphs, Discrete Math., 31 (1980), pp. 59-64.