Copyright © 2001 Elsevier Science B.V. All rights reserved.
On minimal Folkman graphs*1
Received 21 December 1997;
revised 12 August 1998;
accepted 5 March 2000
Available online 22 May 2001.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Following the arrow notation, for a graph G and natural numbers a1,a2,…,ar we write G→(a1,a2,…,ar)v if for every coloring of the vertices of G with r colors there exists a copy of the complete graph Kai of color i for some i=1,2,…,r. We present some constructions of small graphs with this Ramsey property, but not containing large cliques. We also set bounds on the order of the smallest such graphs.
*1 Research supported by KBN Grant 2 P03A 023 09.
1 Supported also by KBN Grant 2 P03A 034 14.
Corresponding author; email: tomasz@math.amu.edu.pl






E-mail Article
Add to my Quick Links

Cited By in Scopus (5)

2 and that 



