An upper bound is established for the linear Turán number ex_r^lin(n, C_{1,k}^r) of k-crowns in linear r-graphs.
Generalized crowns in linear r-graphs.The Electronic Journal of Combinatorics, pages P1–29
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Linear Turán number ex_r^lin(n,T_k^r) is at least n(k-1)/r for any r-uniform tree with k edges; exact upper bound (r+1)n/r for B_4^r with characterization, (2r-1)n/r for E_4^r, and matching lower construction for P_4^r.
citing papers explorer
-
An Upper Bound on the Linear Tur\'{a}n Number of $k$-Crowns
An upper bound is established for the linear Turán number ex_r^lin(n, C_{1,k}^r) of k-crowns in linear r-graphs.
-
Bounds on Linear Tur\'{a}n Number for Trees
Linear Turán number ex_r^lin(n,T_k^r) is at least n(k-1)/r for any r-uniform tree with k edges; exact upper bound (r+1)n/r for B_4^r with characterization, (2r-1)n/r for E_4^r, and matching lower construction for P_4^r.