{"id":"b2e7b532-f442-481e-b67e-b41e3c836f19","arxiv_id":"2502.06699","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":8.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"For large n, every extremal family with no s+1 pairwise 1, so the rainbow-disjoint step in Lemma 24 is unsupported as written.","rationale":"The central claim of Theorem 7 requires both the extremal size bound and the structural characterization. The proof reaches the structural theorems via Theorem 26, whose iterative reduction of uniformity depends on Lemma 24. The reader identified Lemma 24 as the weakest assumption, and I agree that it is load-bearing; however, the sharper defect is not in inequalities (12) and (13) themselves but in the auxiliary Lemma 25 invoked at the final step of Lemma 24. As written, Lemma 25's hypothesis cannot be satisfied when p_i = 1/(2(s+1)), so the existence of the disjoint sets Q_i is not established. This breaks the transfer from spreadness to nu(S,t') <= s and hence the bootstrap. I see no circularity in the overall argument: the induction on s is legitimate, and the use of prior results is external and clearly attributed. The proof is detailed and contains independent support in the form of parameter-free derivations and cited external theorems. The most likely resolution is a typographical error in Lemma 25's threshold, and the surrounding method may well be sound. Nevertheless, as submitted, the step is formally unsupported, and the reader's conditional verdict is appropriate: the paper should not be accepted before this lemma is corrected or its proof supplied. I therefore leave the verdict unchanged.","tokens_in":43810,"tokens_out":21530,"duration_ms":184344,"concrete_test":"Re-derive the invocation in Lemma 24: with p_i = 1/(2(s+1)), compute 3(s+1)p_i = 3/2, which exceeds 1. Then check the statement of the cited KLLM result [18]; if its correct hypothesis is mu_{p_i}(Q_i) >= 3p_i (giving 3/(2(s+1)) <= 3/4, matching the 3/4 lower bound in Lemma 24), the intended argument is valid and the gap is typographical. If the correct hypothesis is literally 3(s+1)p_i, the proof of Lemma 24 fails and Theorem 26's bootstrap lacks a key step.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Located in Section 5.2, Lemma 25 states: for p_1,...,p_{s+1} with sum <= 1/2 and upward-closed Q_i satisfying mu_{p_i}(Q_i) >= 3(s+1)p_i, there exist disjoint representatives. In Lemma 24, after applying Theorem 8 with beta*delta = 1/(2(s+1)), the paper invokes Lemma 25 with p_i = 1/(2(s+1)). The required measure is then 3(s+1)/(2(s+1)) = 3/2, which no probability can satisfy. Thus the quoted KLLM lemma cannot yield the promised disjoint sets Q_i. This is load-bearing because Lemma 24 is exactly the mechanism that converts r-spread decompositions into nu(S,t') <= s; Theorem 26's iterative bootstrap relies on this reduction of t' to reach the hypotheses of The structural theorems. Without a corrected version of Lemma 25, the proof of Theorem 7 has a formal gap. The surrounding argument is detailed and shows no circularity; the most plausible reading is a misstated threshold in Lemma 25, but as written the step fails.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the Hajnal–Rothschild problem: for a family F of k-subsets of [n], bound |F| when ν(F,t) ≤ s, i.e., when one cannot find s+1 members with pairwise intersections of size < t. The authors propose an extremal bound h(n,k,t,s) given by unions of s t-intersecting cliques on disjoint supports and characterize the extremal families as A[K] for such a clique union, for n exceeding two explicit lower bounds. The proof develops an iterative version of the spread approximation method: Theorem 26 provides a coarse approximation by a low-uniformity family S with ν(S,t)≤s; Theorems 27 and 28 give a fine-grained structural description of S; Section 7 combines these with a remainder-emptiness argument to deduce Theorem 7. The manuscript also contains a simpler bound in the spirit of Hajnal–Rothschild with polynomial n-dependence (Theorem 16/Corollary 17) and an analysis of the small cases k=3 and t=k-1.","tokens_in":44029,"tokens_out":4009,"duration_ms":37828,"significance":"If the proof is completed, this would be a substantial advance in extremal set theory: it gives not only an asymptotic size bound but a full structural description of extremal families in a range where the extremal construction is not shifted, and it introduces a potentially powerful iterative spread approximation technique. The paper is built on credible external tools (spread lemma, prior EMC bounds, the KLLM hypercontractivity result) and does not assume the main theorem. The claimed result is falsifiable and precise, and the structural conclusion is significantly stronger than earlier bounds for the Hajnal–Rothschild problem. However, the current manuscript contains a load-bearing gap in the use of Lemma 25 and several compressed or inconsistent statements, so the result cannot be considered established as written.","major_comments":[{"comment":"Lemma 25 is stated with the hypothesis μ_{p_i}(Q_i) ≥ 3(s+1)p_i, but in the application in Lemma 24 the probabilities are set to p_i = 1/(2(s+1)). The required lower bound is then 3(s+1)/(2(s+1)) = 3/2, which no probability can satisfy. The proof of Lemma 24 only establishes μ_{1/(2(s+1))}(Q_i) ≥ 3/4. Consequently, the invoked lemma cannot produce the disjoint rainbow sets Q_i, and the contradiction that proves ν(S,t') ≤ s is unsupported. This step is load-bearing: it is exactly the mechanism that converts r-spread decompositions of F_A(A) into the bound ν(S,t') ≤ s used in the iterative bootstrap of Theorem 26. The gap must be fixed, either by correcting Lemma 25 (for example, if the intended threshold is (3/2)(s+1)p_i or similar) or by providing a different argument for the rainbow matching step.","section":"Section 5.2, Lemma 25 and its use in Lemma 24"},{"comment":"Lemma 5 is stated as a lemma but its proof is only a sketch. The claim that any family K of s cliques of prescribed sizes can be transformed by shifts into a family K' with pairwise disjoint supports without increasing the upper shadow is not obvious and is essential: it justifies the definition of h(n,k,t,s) as a maximum over disjoint supports and is used in Corollary 17 to lower-bound |A[U]|. A complete proof of the shift argument, or a reference to a known statement, is required.","section":"Section 1, Lemma 5"},{"comment":"The abstract states the two n-thresholds both with a factor log_2^4 n, while Theorem 7 states the first threshold with log^2 n (with unspecified base) and the second with log_2^4 n. Since these inequalities are the hypotheses of the main theorem, this inconsistency must be resolved. The proof in Section 7 at several points uses bounds such as n ≥ C s(k-t) log^4 n and n ≥ C t^{4/5} s^{1/5}(k-t) log^2 n; the exact logarithmic power in the first threshold of Theorem 7 needs to match what the proof actually yields.","section":"Abstract and Theorem 7"},{"comment":"Theorem 28 is presented as a compressed analogue of Theorem 27, but it covers a substantial parameter range (t ≤ C s log^3(st)) needed for the second case in the proof of Theorem 7. The proof says only 'We use a similar, albeit simpler, proof strategy' and then gives a short sketch. In particular, the argument that m = 0, the verification that the induction hypothesis applies to S^{(1)}, and the analogue of Lemma 32 for t-element sets are not written out in full. Since Theorem 28 is load-bearing for a whole branch of the main proof, this should be expanded to a complete proof or supplied as a supplementary file.","section":"Section 6.4, Theorem 28"}],"minor_comments":[{"comment":"The lemma statement begins 'Fix p_1,...,p_s' but the family is indexed as Q_1,...,Q_{s+1}. It should read p_1,...,p_{s+1}.","section":"Section 5.2, Lemma 25 statement"},{"comment":"The sentence 'It is easy to that (13) is satisfied' is missing the verb 'see' or 'check'.","section":"Section 5.3, Step B(i)"},{"comment":"In Lemma 34(2), the final displayed chain of inequalities has an inconsistency: it starts with |U_1| ≥ h(n,k,s,t) - (3/2 + 1/(10s)) h(n,k,1,t) and later concludes |U_1| ≥ h(n,k,s,t) - (1/2 + 1/(10(s-1))) h(n,k,1,t), but the intermediate line uses h(n,k,s-1,t) - (1/2 + 1/(10s) + 1/(10s^3)) h(n,k,1,t). The notation is confusing and should be cleaned up.","section":"Section 6.3, Lemma 34"},{"comment":"The outline refers to the 'remainder R' and says it will be shown empty, but the statement of Theorem 7 reserves the equality case for F = A[K]. It would help to state explicitly how the empty-remainder conclusion implies the equality statement, since the argument in Section 7 is somewhat implicit.","section":"Section 4, proof outline"}],"recommendation":"major_revision","confidential_remarks":"The central idea and the claimed theorem are very likely correct, but the current text is not yet a complete proof. The most serious issue is the impossible hypothesis in Lemma 25 as used in Lemma 24; this is a formal gap, not merely a missing detail. The other major issues (Lemma 5 being a sketch, Theorem 28 being compressed, threshold inconsistency) are also nontrivial. If the authors can fix the Lemma 25 application and provide the missing details, the paper would be a strong contribution. I see no evidence of circularity or of the target result being assumed. The reliance on prior spread-approximation work is appropriate and clearly cited."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper gives the first structural solution to the Hajnal–Rothschild problem, and the iterative spread approximation is a genuine methodological addition. Theorem 7 provides an Ahlswede–Khachatrian-type description of extremal families with bounded t-wise matching number, improving the old Hajnal–Rothschild threshold from astronomical to polynomial-style bounds. The proof is long but mostly detailed, and I see no circularity: the induction on s in Theorem 27 is legitimate, and the cited external results carry their own proofs.\n\nThe soft spots are real. Most importantly, Lemma 25 as stated cannot be applied in Lemma 24. With p_i = 1/(2(s+1)), the hypothesis mu_{p_i}(Q_i) >= 3(s+1)p_i becomes mu >= 3/2, which no probability measure satisfies. This is not cosmetic: Lemma 24 is exactly the step that converts r-spreadness of the pieces into nu(S,t') <= s, and Theorem 26's bootstrap needs it. The likely fix is a misstated constant (3p_i instead of 3(s+1)p_i would match the 3/4 bound in the application), but as written the step fails. There are also smaller presentation gaps: the abstract and Theorem 7 state different exponents in the first n-threshold (log_2^4 n vs log^2 n), Lemma 5 is only sketched, and Theorem 28 is a compressed analogue. These are fixable.\n\nOverall, the architecture looks sound and the result is important enough that the gap should not kill the paper. I would send it to a serious referee, with a request to check the corrected version of Lemma 25. Extremal set theorists working on EKR-type problems and on spread approximation methods will want to read this; I would bring it to a reading group, and the Lemma 25 gap is a good exercise in checking hypotheses.","headline":"A serious, likely-true structural result for the Hajnal–Rothschild problem, but the written proof has a load-bearing gap in Lemma 24/25 that should be fixed before the main theorem is accepted.","tokens_in":44582,"tokens_out":4147,"would_cite":true,"duration_ms":36084,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["05D05"],"pacs":[],"model":"deepseek-v4-flash","headline":"For n sufficiently large relative to k, t, and s, the largest k-uniform family with ν(F,t)≤s is exactly a union of s t-intersecting cliques, with size h(n,k,t,s).","keywords":["Hajnal-Rothschild problem","weak t-matching number","t-intersecting families","spread approximation","complete t-intersection theorem","extremal set theory","sunflower lemma","k-uniform hypergraphs"],"falsifier":"Check the equality case by exhaustive search for small parameters that satisfy the theorem's inequalities, e.g. k=4, t=2, s=2 and n just above 2k+C(k−t)($t^{{4/5}}$$s^{{1/5}}$$log^{2}$ n + s $log_2^{4}$ n) for a chosen large absolute C: if any extremal family contains a member that does not contain some (t+x_i)-subset of the corresponding clique's support, the claimed structural uniqueness fails, and if |F|>h(n,k,t,s) the size statement fails.","tokens_in":43580,"feed_emoji":"🧩","tokens_out":11014,"duration_ms":95054,"temperature":0.7,"pith_summary":"The paper resolves a question posed in 1973: how large can a family of k-element subsets of an n-element set be if no s+1 members are pairwise 'almost disjoint', meaning any two intersect in fewer than t points? It proves that once n exceeds 2k plus a polynomial expression in k−t, s, and t (up to log factors), the maximum is h(n,k,t,s), a number defined by the best choice of s pairwise disjoint t-intersecting cliques, and that every family attaining the maximum has exactly that clique-union form. This is a structural result, not just a size bound, and it holds in a range where the extremal construction is not shifted, so the usual shifting method cannot reach it. The proof works by a new iterative version of spread approximation, which peels off quasi-random pieces of the family until only the clique skeleton remains.","feed_headline":"Weak-intersection extremal families get a full structure theorem","feed_subtitle":"For n far above 2k, the largest k-uniform families with no s+1 weak t-matchings are unions of s t-intersecting cliques.","key_machinery":"The machinery is spread approximation. A family is r-spread when, for every set X, the subfamily of members containing X has size at most $r^{{-|X|}}$ times the whole family; the spread lemma says that a sufficiently spread family is found inside random subsets with high probability. The paper's new twist is an iterative scheme: Theorem 20 locates a dense set X inside a large subfamily, Theorem 23 peels off a spread piece on top of X, and Lemma 24 relaxes the condition ν(F,t)≤s to ν(S,t')≤s for a smaller t' while keeping the peeled pieces spread. Alternating these steps shrinks the uniformity of the approximating family S from k down to t+O((t/s)^{1/5}+log(st)), at which point Theorems 27 and 28 force S to be a union of s t-intersecting cliques, and a final spread argument shows the leftover remainder is empty.","core_discovery":"The central claim is Theorem 7: there is an absolute constant C such that whenever n>2k+C(k−t)$t^{{4/5}}$$s^{{1/5}}$$log^{2}$ n and n>2k+C(k−t)s $log_2^{4}$ n, any family F⊂binom([n],k) with ν(F,t)≤s satisfies |F|≤h(n,k,t,s), and equality forces F=A[K] for a family K that is a union of s t-intersecting cliques binom(Y_i,t+x_i) with |Y_i|=t+2x_i, as in Construction 4. Here h(n,k,t,s) is the maximum size of A[K] over all choices of nonnegative x_i≤k−t with pairwise disjoint supports Y_i. Thus the extremal families coincide with the upper shadows of such clique unions, exactly the shape predicted by the Complete t-Intersection Theorem when generalized from one clique to s cliques. The theorem improves the original 1973 result, whose n0 was enormous, to polynomial thresholds, and it applies in a regime where the extremal family is not shifted.","pith_inferences":["Editorial inference: the same iterative spread-approximation loop — find a dense piece, peel it, relax the matching parameter — is likely transferable to neighbouring forbidden-intersection problems where the ambient family is not the full binomial family.","Editorial inference: the paper leaves open the exact transition value of n where the optimal clique size changes; its own remarks suggest that near the transition only two consecutive clique sizes appear, a statement that could be checked computationally for small k,t,s.","Editorial inference: the proof's dependence on large n is real — Proposition 11 shows that for k=3,t=2,n=6 the extremal families are not clique unions — so extending the structural conclusion down to n close to 2k would require a genuinely different mechanism.","Editorial inference: h(n,k,t,s) itself is not given in closed form; a practical consequence is that a separate finite optimization problem for the clique sizes remains, and solving it would give explicit extremal sizes in the covered range."],"forward_implications":["The 1973 problem is reduced in this range to choosing s clique sizes x_i; the extremal family is always some A[K].","For s=1, the theorem recovers the Complete t-Intersection Theorem structure in the covered large-n range, with the unique extremal family being a single t-intersecting clique D_i.","The earlier 1973 bound required n0 roughly k^{t^2}s^t; the new thresholds are polynomial in s^{1/5}t^{4/5} and logarithmic factors, so the theorem is meaningful for fixed t,s as k grows.","Because the extremal example is non-shifted, any attempt to prove the full problem by shifting alone must fail in this range; the spread-approximation route is essential.","The empty-remainder conclusion means the approximation is exact for extremal families, not merely within a small additive error of the maximum."],"supporting_citations":[{"why":"States the 1973 theorem and the n0 bound that this paper improves; it is the result being generalized.","marker":"[16]"},{"why":"Gives the Complete t-Intersection Theorem, whose extremal constructions D_i are the building blocks used in Construction 4.","marker":"[1]"},{"why":"Establishes the basic star bound for t-intersecting families that underlies the s=1 case and the clique-size comparisons.","marker":"[7]"},{"why":"Introduced the spread approximation technique that the paper enhances with the iterative procedure.","marker":"[22]"},{"why":"Gives the spread lemma (sunflower bound) used as Theorem 8 to show spread families appear in random subsets.","marker":"[2]"},{"why":"Provides the rainbow matching lemma used in Lemma 25 to find disjoint witnesses among the spread pieces.","marker":"[18]"},{"why":"Supplies a universal upper bound for t-intersecting families used in Lemma 34 to compare h(n,k,s,t) with h(n,k,s−1,t) and h(n,k,1,t).","marker":"[12]"}],"fun_headline_variants":["Extremal weak t-intersection families are unions of s cliques","Hajnal-Rothschild problem gets polynomial-threshold solution","Weak t-intersection extremal families finally characterized","For large n, no s+1 weak t-matchings force a union of s cliques"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof depends on being able to keep the spread pieces of the family so evenly distributed that, after removing the members that nearly intersect the already-chosen pieces, a large r-spread subfamily survives; the lower bounds on n in Theorem 7 exist precisely to make this survival step work, and if those inequalities fail the iterative approximation never reaches the clique structure.","fun_headline_variants_meta":{"raw":{"variants":["Extremal weak t-intersection families are unions of s cliques","Hajnal-Rothschild problem gets polynomial-threshold solution","Weak t-intersection extremal families finally characterized","For large n, no s+1 weak t-matchings force a union of s cliques"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000786,"raw_usage":{"total_tokens":3525,"prompt_tokens":1058,"completion_tokens":2467,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":674,"completion_tokens_details":{"reasoning_tokens":2388}},"tokens_in":674,"tokens_out":2467,"duration_ms":17508,"temperature":1.0,"reasoning_tokens":2388,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-08T14:36:57.711145+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Check the equality case by exhaustive search for small parameters that satisfy the theorem's inequalities, e.g. k=4, t=2, s=2 and n just above 2k+C(k−t)($t^{{4/5}}$$s^{{1/5}}$$log^{2}$ n + s $log_2^{4}$ n) for a chosen large absolute C: if any extremal family contains a member that does not contain some (t+x_i)-subset of the corresponding clique's support, the claimed structural uniqueness fails, and if |F|>h(n,k,t,s) the size statement fails.","supporting_citations":[{"cited_title":"Hajnal, B","cited_arxiv_id":null,"evidence_quote":"States the 1973 theorem and the n0 bound that this paper improves; it is the result being generalized."},{"cited_title":"Hypercontractivity for global functions and sharp thresholds","cited_arxiv_id":"1906.05568","evidence_quote":"Provides the rainbow matching lemma used in Lemma 25 to find disjoint witnesses among the spread pieces."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies a universal upper bound for t-intersecting families used in Lemma 34 to compare h(n,k,s,t) with h(n,k,s−1,t) and h(n,k,1,t)."}],"review_version":1}