Equilateral triangles in finite metric spaces

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages

  Mascioni, Vania ^a  

^a BALL STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 3042622003     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1771     Document Type: Article

References (10)

1. F.R.K. Chung: On the Ramsey numbers N(3, 3, . . . , 3; 2), Discrete Mathematics 5 (1973) 317-21.
2. F.R.K. Chung, C.M. Grinstead: A survey of bounds for classical Ramsey numbers, Journal of Graph Theory 7 (1983) 25-37.
3. S. Fettes, R.L. Kramer, S. Radziszowski: An upper bound of 62 on the classical Ramsey number R(3, 3, 3, 3), to appear in Ars Combinatoria.
4. H. Fredricksen, M. M. Sweet: Symmetric sum-free partitions and lower bounds for Schur numbers, Electronic J. Combin. 7 (2000), R32, 9pp.
5. R. E. Greenwood, A. M. Gleason: Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955) 1-7.
6. J. G. Kalbfleisch, R. G. Stanton: On the maximal triangle-free edge-chromatic graphs in three colors, J. Combin. Theory 5 (1968) 9-20.
7. R.L. Kramer: The classical Ramsey number R(3, 3, 3, 3; 2) is no greater than 62, unpublished manuscript (available for download as a .pdf file at the website http://www.math.iastate.edu/maddux/papers/ram.pdf).
8. 16's, J. Combin. Theory, Series B 45 (1988) 120-4.
9. S.P. Radziszowski: Small Ramsey Numbers, Electronic J. Combin. (2002), DS1.9 (dynamic survey, revision # 9 dated July 15, 2002), 42pp.
10. F.P. Ramsey: On a problem of formal logic, Proc. London Math. Soc. (2) 30 (1930) 264-286.