oo. 1. PROBLEMS OF THE CONTESTS 30 1980 1. For a real number x, let lixil denote the distance between x and the closest integer. Let 0 < x,,, < 1 (n = 1, 2, ... ), and let e > 0. 15) [V. T. Sos] 2. Let H be the class of all graphs with at most 2k0 vertices not containing a complete subgraph of size R1. Show that there is no graph H E 1-l such that every graph in 7-l is a subgraph of H.
Rated 5 – based on votes of