The first classical ramsey number for hypergraphs is computed

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 1991, Pages 304-308

  McKay, Brendan D ^a   Radziszowski, Stanislaw P ^b  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b ROCHESTER INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85028299265     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. D. De Caen, D. L. Kreher, W. H. Mills and S. P. Radziszowski, On the Covering of f-sets with (t+l)-sets: C (9, 5, 4) and C (10, 6, 5), to appear in Discrete Mathematics (1990).
2. G. Giraud, Majoration du nombre de Ramsey ternaire-bicolore en (4, 4), C. R. Acad. Sc. Paris, vol. 269, no. 15, 620-622 (1969).
3. J. R. Isbell, N (4, 4;3) ≥13, JCT 6, 210 (1969).
4. B. D. McKay, Nauty User's Guide, Technical Report TR-CS-90-02, Computer Science Department, Australian National University (1990).
5. A. J. Schwenk, An Improved Bound for the Classical Ramsey Number R (4, 4;3), U. S. Naval Academy, preprint (1978).
6. A. F. Sidorenko, On Turán Numbers T (n, 5, 4) and Number of Monochromatic 4-cliques in 2-colored 3-graphs (in Russian), Voprosy Kibernetiki, no. 64, 117-124 (1980).