Spanning Subgraphs of Random Graphs

Combinatorics Probability and Computing

Volumn 9, Issue 2, 2000, Pages 125-148

  Riordan, Oliver ^a,b  

^a BIELEFELD UNIVERSITY   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034418623     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548399004150     Document Type: Article

References (8)

1. Alon, N. and Füredi, Z. (1992) Spanning subgraphs of random graphs: Research problems. Graphs and Combin. 8 91-94.
2. Bollobás, B. (1985) Random Graphs, Academic Press, London.
3. Bollobás, B. and Leader, I. (1990) Exact face-isoperimetric inequalities. Europ. J. Combinatorics 11 335-340.
4. Bollobás, B. and Leader, I. (1991) Edge-isoperimetric inequalities in the grid. Combinatorica 11 299-314.
5. Fernandez de la Vega, W. and Manoussakis, Y. (1994) Grids in random graphs. Random Structures and Algorithms 5 329-336.
6. Janson, S. (1994) The numbers of spanning trees, Hamilton cycles and perfect matchings in a random graph. Combinatorics, Probability and Computing 3 97-126.
7. Moon, J. W. (1972) The variance of the number of spanning cycles in a random graph. Studia Sci. Math. Hungar. 7 281-283.
8. Venkatesan, R. and Levin, L. (1988) Random instances of a graph coloring problem are hard. In Proc. 20th Annual Symposium on the Theory of Computing, ACM Press, pp. 217-222.