ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Discrete Mathematics
Volume 236, Issues 1-3, 6 June 2001, Pages 245-262
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (169 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0012-365X(00)00445-3    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2001 Elsevier Science B.V. All rights reserved.

On minimal Folkman graphs*1

Tomasz Image uczakCorresponding Author Contact Information, E-mail The Corresponding Author, Andrzej RuciImage ski and Sebastian UrbaImage ski1

Faculty of Mathematics and Computer Science, Department of Discrete Mathematics, Adam Mickiewicz University, ul. Oatejki 48/49, 60-769, PoznaImage , Poland

Received 21 December 1997;
revised 12 August 1998;
accepted 5 March 2000
Available online 22 May 2001.

Purchase the full-text article



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 Contact Information Corresponding author; email: tomasz@math.amu.edu.pl


Discrete Mathematics
Volume 236, Issues 1-3, 6 June 2001, Pages 245-262
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.