Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring.

by Jon H. Folkman

Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback17 pages $20.00 $16.00 20% Web Discount

An investigation of a class of graphs G with the property that if the edges of G are colored red and blue, then either G contains r mutually adjacent vertices with all connecting lines colored red or s mutually adjacent vertices with all connecting lines colored blue. The study concerns the maximum number of mutually adjacent vertices that such a graph must have and shows that there exist graphs with only max(r, s) mutually adjacent vertices. 17 pp

This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.