Colorings generated by monotone properties

Random Structures and Algorithms

Volumn 12, Issue 1, 1998, Pages 1-25

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

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF MEMPHIS   (United States)

Author keywords

Graph colorings; Random graphs

Indexed keywords

EID: 0032330946     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199801)12:1<1::AID-RSA1>3.0.CO;2-2     Document Type: Article

References (5)

1. B. Bollobás, Random Graphs, Academic Press, London, 1985.
2. B. Bollobás, Combinatorics, Cambridge University Press, Cambridge, 1986.
3. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Ann. Math. Statist., 23, 493-507 (1952).
4. E. de la Vina and S. Fajtlowicz, Ramseyan properties of graphs, Electronic J. Combinatorics, 3(1) (1996).
5. R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey Theory, 2nd ed., Series in Discrete Math. and Optimization, Wiley Interscience, New York, 1990.