Abstract
Suppose the edges of a graph G are painted in k colors. We say a subgraph H of G is monochromatic if all its edges receive the same color. We say a k-painting of G is proper with respect to H if G contains no monochromatic subgraph isomorphic to H in that painting. If no subgraph is specified, “proper” will mean proper with respect to triangles — graphs isomorphic to K3.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Second Edition, Birkhäuser Boston
About this chapter
Cite this chapter
Wallis, W.D. (2007). Ramsey Theory. In: A Beginner’s Guide to Graph Theory. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4580-9_10
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4580-9_10
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4484-0
Online ISBN: 978-0-8176-4580-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)