Constrained graph processes

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-20

  Bollobás, Béla ^a   Riordan, Oliver ^a  

^a NONE

Author keywords

Random graphs

Indexed keywords

EID: 0007514228     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1496     Document Type: Article

References (7)

1. B. Bollobás, Random Graphs, Academic Press, London 1985, xvi+447pp.
2. B. Bollobás, Combinatorics, Cambridge University Press, 1986, xii+177pp.
3. B. Bollobás and O. Riordan, Colorings generated by monotone properties, Random Structures and Algorithms 12 (1998), 1-25.
4. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statistics 23 (1952) 493-507.
5. P. Erdos, S. Suen and P. Winkler, On the size of a random maximal graph, Random Structures and Algorithms 6 (1995), 309-318.
6. S. Janson, Poisson approximation for large deviations, Random Structures and Algorithms 1 (1990), 221-229.
7. D. J. Kleitman, Families of non-disjoint subsets, J. Combin. Theory 1 (1966), 153-155.