Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Quotient compression obstruction
The polynomial-size quotients in Random quotients cannot in general be replaced by linear-size quotients, even for families whose transversal-to-rank ratio tends to three quarters. In fact the obstruction below applies to every fixed subquadratic ground-set bound. It does not resolve either assertion of Problem 644: its families are near-boundary examples, not counterexamples, and their guards can be removed by incidence projection.
Intersecting families on a small ground set
Lemma. A nonempty pairwise-intersecting family of nonempty sets on at most points, with at most members, satisfies
Here and below logarithms are natural.
Write . Each edge is a transversal, so every edge has at least points. Sample
points independently and uniformly from an -point ground set, with replacement. The expected number of edges missed by the sample is at most . Some sample therefore misses at most one edge. Supplementing it by one point, if necessary, gives
Solving this quadratic inequality proves (1).
The guarded construction
Let run through primes, and put
Let be the complete -uniform family on points. On a disjoint ground set, let be the disjoint union of the line families of projective planes of order . Define
The complete family has and . Indeed, seven rows have total incidence , so some point meets at least five rows. Any two rows intersect, so one further point meets the at-most-two remaining rows.
Each plane has lines, of size , and transversal number . A line meets every line, whereas points meet at most lines. It follows that
A transversal of the product (2) must cover at least one factor: otherwise choose an edge missed in each factor and take their union. Conversely, a cover of either factor covers the product. Therefore
All edges have size . The family inherits from , and .
Every small quotient collapses
Let be any map. In particular, it may identify points from different planes or factors. Each image plane remains pairwise intersecting and has at most distinct edges. A cover of all image planes covers every image edge of (2). Applying (1) to each plane gives
For each fixed , if , then the right side of (4) is . Indeed, , , and division by gives .
More quantitatively, preserving a fixed proportion of requires
For sufficiently large , this follows from (3)--(4) by subtracting one and squaring; gives the asymptotic form.
The one-product-edge deletion lemma in Prime guard families also makes these examples conjunction-prime without changing their uniformity or transversal number. They still have , and (4) continues to hold for the resulting subfamily.
What remains possible
The guard rank is . Erasing guard incidences recovers , preserves the transversal number and , and reduces the ground set to linear size. Consequently the example does not exclude a ground-set reduction preceded by an appropriate structural normalization. It rules out vertex identification alone, even with exact conjunction-primality. There is no asserted obstruction under simultaneous edge and incidence criticality, and no conclusion about the existence of .