... covers y If A ⊆ V then we let A denote the subgraph of G induced by A Table contains the value of γ(n, δ) for n ≤ 16, ≤ δ ≤ n − if the value is known, otherwise upper and lower bounds for γ(n, δ) We ... 5, 6, 7, 8, 9, 10 The number of unknown γ(n, δ) can be reduced further by using the upper bounds given in Proposition 3.1 (taking s = 1) and Reed’s Theorem See Table for upper bounds computed using ... ’s of the form {x, z} and {y, w} or, of the form {x, w} and {y, z} But this contradicts our assumption that the two element Av ’s are never disjoint This completes the proof in case (1b) and...