Cover: Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring.

Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring.

Published 1967

by Jon H. Folkman

Purchase Print Copy

 Format Price
Add to Cart Paperback17 pages $20.00

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 research memorandum series. The Research Memorandum was a product of RAND from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND 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.