June 2014
Intermediate to advanced
512 pages
17h 55m
English
GENERALIZED RAMSEY NUMBER (GRN): Given a complete graphwith its edges partially two colored (i.e., it has a function
), and given an integer K > 0, determine whether it is true that for any two-colored restriction
of c (i.e.,
for all
and
whenever
), there is a monochromatic clique in G of size K.