For a prime , take rank- subsets of with no distinct pair meeting in points. Split by membership of coordinate one. In the containing part, remove that coordinate; in the avoiding part, first take complements and then remove it. Both transformed families have rank on points. Their distinct intersections avoid residue modulo . The uniform Frankl-Wilson theorem bounds each by , yielding the displayed stronger form of the requested bound.
Fix a -set . Take every -set with a -subset of the remaining points, together with the complements of all these sets. Within either half, intersections have size at least . Across the halves they have size . Thus no intersection has size , and the two disjoint halves give the displayed family size.

Articles by others on the same topic (0)

There are currently no matching articles.