Research Problems
Bulletin of the American Mathematical Society · 1964
Finite combinatorial set theory.Let a, b, c be positive integers, a>b>c.Given a set S of a elements and a class K of n distinct subsets of b elements each from 5, there must exist three distinct sets in K having at least c elements in common, provided n is sufficiently large.Develop upper and lower bounds on n{a, b } c).(The three sets can of course be generalized to />1.) (Received January 30, 1964.) 7. G. B. Dantzig: Eight unsolved problems from mathematical programming.