GENERALIZED RAMSEY NUMBER (GRN): Given a complete graph with its edges partially two colored (i.e., it has a function ), and given an integerK> 0, determine whether it is true that for any two-colored restriction ofc(i.e., for all and whenever ), there is a monochromatic clique inGof sizeK.

Start Free Trial

No credit card required