CPC
2008
14 years 23 days ago
2008
If G is a graph with vertex set [n] then A 2[n] is G-intersecting if for all A, B A either A B = or there exist a A and b B such that a G b. The question of how large a k-un...