Random maximal H-free graphs

Random Structures and Algorithms

Volumn 18, Issue 1, 2001, Pages 61-82

  Osthus, Deryk ^a   Taraz, Anusch ^a  

^a HUMBOLDT UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035529272     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/1098-2418(200101)18:1<61::AID-RSA5>3.0.CO;2-T     Document Type: Article

References (16)

1. D. Aldous, A random tree model associated with random graphs, Random Struct Alg 1 (1990), 383-402.
2. N. Alon and J.H. Spencer, The Probabilistic Method, Wiley-Interscience, New York, 1992.
3. B. Bollobás and O.M. Riordan, Constrained graph processes, Electronic J Combin 7 (2000), # R18.
4. F. Chung, Z. Füredi, R.L. Graham, and P.D. Seymour, On induced subgraphs of the cube, J Combin Theory Ser A 49 (1988), 180-187.
5. F. Chung and R.L. Graham, Erdos on Graphs: His Legacy of Unsolved Problems, A. K. Peters, Wellesley, 1998.
6. P. Erdos, S. Suen, and P. Winkler, On the size of a random maximal graph, Random Struct Alg 6 (1995), 309-318.
7. P. Erdos and P. Tetali, Representation of integers as the sum of k terms, Random Struct Alg 1 (1990), 245-261.
8. A. Frieze, On the value of a minimum spanning tree problem, Discrete Appl Math 10 (1985), 47-56.
9. S. Janson, T. Łuczak, and A. Ruciński, Random Graphs, Wiley-Interscience, New York, 2000.
10. T.R. Jensen and B. Toft, Graph Coloring Problems, Wiley-Interscience, New York, 1995.
11. 2/log t, Random Struct Alg 7 (1995), 173-207.
12. M. Krivelevich, Bounding Ramsey numbers through large deviation inequalities, Random Struct Alg 7 (1995), 145-155.
13. D. Osthus, H.J. Prömel, and A. Taraz, On the evolution of triangle-free graphs, 1999, submitted.
14. A. Ruciński and N.C. Wormald, Random graph processes with degree restrictions, Combin Probab Comput 1 (1992), 169-180.
15. J.H. Spencer, Counting extensions, J Combin Theory Ser A 53 (1990), 247-255.
16. J.H. Spencer, Maximal triangle-free graphs and Ramsey R(3, t), unpublished manuscript, 1995.