Accession Number : AD0661258

Title :   GRAPHS WITH MONOCHROMATIC COMPLETE SUBGRAPHS IN EVERY EDGE COLORING,

Corporate Author : RAND CORP SANTA MONICA CALIF

Personal Author(s) : Folkman,John

Report Date : OCT 1967

Pagination or Media Count : 17

Abstract : The report contains 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. (Author)

Descriptors :   (*GRAPHICS, *COMBINATORIAL ANALYSIS), COLORS, THEOREMS, MAPPING(TRANSFORMATIONS), TOPOLOGY

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE