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 2representative citing papers
The paper proves exact and near-exact linear Turán bounds for several small r-uniform trees, including a lower bound for the 4-edge path, but one upper-bound proof contains an unjustified assumption.
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
The paper proves exact and near-exact linear Turán bounds for several small r-uniform trees, including a lower bound for the 4-edge path, but one upper-bound proof contains an unjustified assumption.