REVIEW 1 major objections 4 minor
Linear Tur\'an Numbers of Uniform Hypertrees
T0 review · 1 major / 4 minor · reviewed 2026-08-01 · deepseek-v4-flash
Pith's one-line read The paper proves that the maximum number of edges in a 4-uniform linear hypergraph avoiding the 4-edge path is 5n/4, attained only by disjoint unions of Steiner systems S(2,4,16), and corrects an earlier proof by exhibiting counterexamples
desk verdict Worth refereeing: P_4^4 result is clean, but the crown lower bound in Proposition 2 quietly assumes an affine plane of order r-1, which fails for r=7. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing objects are Steiner systems S(2,r,n): linear r-uniform hypergraphs in which every pair of vertices lies in exactly one hyperedge. They saturate the pair-counting upper bound and provide all extremal constructions, including the lower bound for the path and the equality cases for the broom and the 4-uniform path. For the P_4^4 proof, the machinery is the line graph L(H) of the hypergraph: linearity and P_4^4-freeness make L(H) a connected cograph (a graph with no induced path on 4 vertices), 5-regularity makes it 16-regular, and an edge-decomposition of L(H) into n copies of K_5 — one per vertex of H — turns a counting contradiction on the cograph's connected components into
What would settle it
Find a connected 4-uniform linear hypergraph on 20 vertices with more than 25 hyperedges and no four hyperedges forming a P_4^4; the paper's proof says this is impossible, so its existence would falsify the bound. Equivalently, exhibit a connected 16-regular cograph on 25 vertices decomposable into 20 edge-disjoint K_5s, which the paper's counting rules out.
Extended reading notes
Core claim
The central claim is that the linear Turán number of the 4-uniform path P_4^4 is at most 5n/4, with equality exactly when the hypergraph is a disjoint union of Steiner systems S(2,4,16). More broadly, the paper determines the linear Turán number of the broom B_4^r as (r+1)n/r when S(2,r,r^2) exists, characterizes extremal hypergraphs as disjoint unions of that Steiner system, and gives upper and lower bounds for the crown E_4^r that leave only a constant-factor gap. For the path P_4^r it constructs dense examples from S(2,r,r^2) reaching (r+1)n/r and conjectures sharpness. For r=4, it exhibits counterexamples to a structural claim (V(S_k)=V(H)) in an earlier proof, then gives a new proof: a
Load-bearing premise
The crown lower bound is stated under only a divisibility condition, but its proof requires an affine plane of order r-1; such planes exist only when r-1 is a prime power, and for r=7 this fails, so the theorem as stated is not established for all r it claims to cover.
Editorial extensions
If this is right
- If correct, ex_4^lin(n, P_4^4) = 5n/4 is fully resolved for all n admitting a partition into 16-vertex blocks, with a complete equality characterization.
- The exact value ex_r^lin(n, B_4^r) = (r+1)n/r holds whenever S(2,r,r^2) exists, and disjoint unions of that Steiner system are the only extremal hypergraphs.
- The crown E_4^r has (2r-1)n/r as an upper bound, and the new lower construction shows the true value lies within a constant factor, not exactly pinned.
- For every linear r-uniform hypertree T_k^r, the construction shows the linear Turán number is at least n(k-1)/r whenever the divisibility and design-existence conditions are met.
- The counterexamples show the earlier proof of the 4-uniform path bound is not salvageable as written, so the new argument is the justification for the bound.
Reading between the lines
- One testable extension: if the line-graph/cograph argument for r=4 generalizes to other r where S(2,r,r^2) exists, the conjectured bound (r+1)n/r for P_4^r may reduce to a similar regularity plus cograph decomposition; the key check is whether the extremal hypergraph must be (r+1)-regular.
- The gap in the crown lower bound — it needs an affine plane of order r-1, not just the stated divisibility condition — suggests the bound may fail for r=7 and motivates a search for alternative designs or a corrected hypothesis.
- The paper's recurring theme, Steiner systems as the unique extremal objects, hints that for many linear hypertrees exact Turán results might follow from design-existence theorems, making the conditional results unconditional for all sufficiently large admissible n.
- A direct project is to decide Conjecture 1 for r=5 or r=8, where S(2,r,r^2) exists, by attempting the same cograph decomposition and checking whether any non-design extremal hypergraphs appear.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies linear Turán numbers of r-uniform linear hypertrees. It proves the exact linear Turán number of the uniform star S_k^r, gives a general lower-bound construction for arbitrary linear hypertrees conditional on the existence of certain Steiner systems, determines the exact extremal value and extremal structure for the broom B_4^r, obtains an upper bound and a lower-bound construction for the crown E_4^r, and provides a lower bound for P_4^r together with a sharp bound for connected P_4^r-free hypergraphs under degree hypotheses. For r=4, the paper exhibits counterexamples to a structural claim in the earlier proof of Zhang and Wang, proves ex_4^{lin}(n,P_4^4) ≤ 5n/4, and characterizes equality as disjoint unions of S(2,4,16).
Significance. The main contribution is the sharp 4-uniform result for P_4^4, with a full extremal characterization, and the exact linear Turán number for the broom B_4^r. The paper also identifies a concrete gap in a previously published proof, which is a useful service to the area. The proofs are elementary and, apart from the issue discussed below, the trace-based case analysis in Theorem 7 appears sound. The extremal characterization via line graphs and cographs is elegant. However, one lower-bound claim, Proposition 2, is overstated because it silently assumes the existence of an affine plane of order r-1; this affects the crown lower-bound claim for infinitely many r but not the central P_4^4 theorem.
major comments (1)
- [§5, Proposition 2] Proposition 2 is stated for all r≥3 under only the divisibility condition (r−1)^2 | (n−r), but its proof begins 'Let A be an affine plane of order q' with q=r−1. An affine plane of order q exists only when S(2,q,q^2) does, and in particular only if q is a prime power or another admissible order. For r=7, q=6, the Bruck–Ryser–Chowla theorem rules out such a plane; the paper itself notes in §1.3 that no S(2,6,36) exists. Thus the construction is undefined for r=7 and for other non-prime-power values of r−1, and the claimed lower bound ex_lin_r(n,E_4^r) ≥ r(n−r)/(r−1) is not established under the stated hypotheses. This is load-bearing for the crown lower-bound claim, though it does not affect Theorem 4 or Theorem 7. I recommend restating Proposition 2 with the explicit existence assumption of an affine plane of order r−1, or equivalently S(2,r−1,(r−1)^2), and marking the lower bound as con
minor comments (4)
- [§7, proof of Theorem 6] In the displayed computation of (r+1)n/r − |E(H)|, the term |T|/r is written as |T|+2/r in the third line. The previous line has |T|/r correctly. The conclusion is unaffected, but the displayed algebra should be corrected.
- [§8.2, extremal characterization in Theorem 7] The sentence 'Since G is a connected cograph, G must be disconnected. Clearly G is m−17 regular' is confusing as written: it should refer to the complement of G, not to G itself. With 'complement' substituted, the component argument is correct.
- [§8, Theorem 7 statement] The equality statement reads 'equality holds if and only if the hypergraphs is disjoint union of Steiner systems'; this should be 'the hypergraph is a disjoint union'.
- [§3, proof of Theorem 2] The sentence 'From the above claim |V(H_i)| ≥ (r−1)k+1 = t+(r−1)' is misstated. The component has |V(H_i)|=t, while a copy of T_r^k would require (r−1)k+1 > t vertices. The comparison should be made between these two quantities, not written as a lower bound on |V(H_i)|.
Circularity Check
No circularity: the proofs are self-contained and the lower-bound constructions are honestly conditional on external design-existence facts.
full rationale
The derivation chain is self-contained rather than circular. The upper bounds in Proposition 1 and Theorems 3, 4, 6, and 7 are proved from the definitions of linearity and degree via handshaking and double-counting, not by assuming the target extremal value. The lower-bound constructions in Theorems 2 and 5 and Proposition 2 explicitly invoke external existence facts—Steiner systems S(2,r,t), S(2,r,r^2), or an affine plane of order r-1—and then verify the relevant forbidden configuration is absent; no fitted parameter is renamed as a prediction. The equality characterizations in Theorems 3 and 7 are genuine proofs: the 'if' direction computes edge counts from the Steiner-system structure, while the 'only if' direction forces regularity and then pair-count equality, thereby deriving the Steiner system rather than assuming it. The self-citations to [1] and [2] are not load-bearing: the crown upper bound in Section 5 is re-proved through Lemmas 3 and 4, and the new P_4^4 result is argued independently. The one notable weakness is Proposition 2, whose stated hypothesis (r-1)^2 | (n-r) does not guarantee the existence of the affine plane of order r-1 used in its construction; for r=7 (or any r with r-1 not a prime power) the construction is undefined. That is a correctness/conditional-existence gap, not circularity, and it does not affect the central r=4 theorem or the upper-bound results.
Assumptions & free parameters
assumptions (4)
- domain assumption Steiner systems S(2,r,t) exist for the parameters used in Theorem 2, and S(2,r,r^2) exist for Theorems 3, 5 and the equality cases of Theorems 3 and 7.
- ad hoc to paper An affine plane of order q = r-1 exists in Proposition 2.
- domain assumption Keevash's design existence theorem: for every fixed r, all sufficiently large admissible n admit Steiner systems S(2,r,n).
- standard math Standard cograph facts: a connected P_4-free graph has disconnected complement; clique-decomposition arguments in line graphs.
Cite this review
Pith. "Pith review of Linear Tur\'an Numbers of Uniform Hypertrees." pith.science (2026). https://pith.science/paper/IYCXKDPK
@misc{pith2026260716854,
author = {Pith},
title = {Pith review of: Linear Tur\'an Numbers of Uniform Hypertrees},
year = {2026},
howpublished = {\url{https://pith.science/paper/IYCXKDPK}},
note = {Machine review of arXiv:2607.16854}
}
abstract
A hypergraph is \emph{linear} if every pair of vertices is contained in at most one hyperedge. For a family $\mathcal{F}$ of $r$-uniform hypergraphs, let $\operatorname{ex}^{\mathrm{lin}}_r(n,\mathcal{F})$ denote the maximum number of hyperedges in an $n$-vertex $\mathcal{F}$-free linear $r$-uniform hypergraph. Extending earlier work on acyclic triple systems, we study linear Tur\'an numbers of uniform hypertrees in higher uniformity. For the linear star $S_k^r$, we prove \[ \operatorname{ex}^{\mathrm{lin}}_r(n,S_k^r)\leq \frac{n(k-1)}{r}, \] with equality precisely for $(k-1)$-regular linear $r$-uniform hypergraphs, whenever such hypergraphs exist. Under suitable divisibility and design-existence assumptions, we also construct $T_k^r$-free hypergraphs with $n(k-1)/r$ edges for every linear $r$-uniform hypertree $T_k^r$ with $k$ hyperedges. For the four-edge broom $B_4^r$, we prove \[ \operatorname{ex}^{\mathrm{lin}}_r(n,B_4^r)\leq \frac{(r+1)n}{r}, \] with equality exactly for disjoint unions of Steiner systems $S(2,r,r^2)$, whenever such systems exist. For the crown $E_4^r$, we establish a degree-sensitive upper bound implying \[ \operatorname{ex}^{\mathrm{lin}}_r(n,E_4^r)\leq \frac{(2r-1)n}{r}, \] and give a lower-bound construction leaving a constant-factor gap. Finally, we settle the linear Tur\'an problem for the four-edge path $P_4^r$ in every uniformity: \[ \operatorname{ex}^{\mathrm{lin}}_r(n,P_4^r)\leq \frac{(r+1)n}{r}. \] Equality holds precisely for disjoint unions of Steiner systems $S(2,r,r^2)$. We also give counterexamples to a key structural claim used in a previously proposed proof of the $4$-uniform case.
Figures
Reviewed August 1, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.