Perfect Matchings in Random Uniform Hypergraphs

Random Structures and Algorithms

Volumn 23, Issue 2, 2003, Pages 111-132

  Kim, Jeong Han ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041375549     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10093     Document Type: Article

References (17)

1. N. Alon and J. Spencer, The probabilistic method. Second edition, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York, 2000.
2. N. Alon and R. Yuster, Threshold functions for H-factors, Combin Probab Comput 2 (1993), 137-144.
3. A. Békéssy, P. Békéssy, and J. Komlós, Asymptotic enumeration of regular matrices, Studia Sci Math Hungar 7 (1972), 343-353.
4. E. Bender and R. Canfield, The asymptotic number of labeled graphs with given degree sequences, J Combin Theory Ser A 24 (1978), 296-307.
5. B. Bollobás, A probabilistic proof of an asymptotic formula for the number of labelled regular graphs, European J Combin 1 (1980), 311-316.
6. C. Cooper, A. Frieze, M. Molloy, and B. Reed, Perfect matchings in random r-regular, s-uniform hypergraphs, Combin Probab Comput 5 (1996), 1-14.
7. P. Erdos and A. Rényi, On the existence of a factor of degree one of a connected random graph, Acta Math Acad Sci Hungar 17 (1966), 359-368.
8. A. Frieze and S. Janson, Perfect matchings in random s-uniform hypergraphs, Random Structures Algorithms 7 (1995), 41-57.
9. S. Janson, Random regular graphs: Asymptotic distributions and contiguity, Combin Probab Comput 4 (1995), 369-405.
10. J. H. Kim and N. Wormald, Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs, J Combin Theory Ser B 81 (2001), 20-44.
11. M. Krivelevich, Perfect fractional matchings in random uniform hypergraphs, Random Structures Algorithms 9 (1996), 317-334.
12. M. Krivelevich, Triangle factors in random graphs, Combin Probab Comput 6 (1997), 337-347.
13. R. Robinson and N. Wormald, Almost all cubic graphs are Hamiltonian, Random Structures Algorithms 3 (1992), 117-125.
14. R. Robinson and N. Wormald, Almost all regular graphs are Hamiltonian, Random Structures Algorithms 5 (1994), 363-374.
15. A. Ruciński, Matching and covering the vertices of a random graph by copies of a given graph, Discrete Math 105 (1992), 185-197.
16. J. Schmidt and E. Shamir, A threshold for perfect matchings in random d-pure hypergraphs, Discrete Math 45 (1983), 287-295.
17. N. Wormald, Some problems in the enumeration of labelled graphs, Ph.D. thesis, University of Newcastle, 1978.