From the 1 of 2 linked papers with an AI index.
2 papers
math.CO2026
Linear Turán Numbers of Uniform Hypertrees
Rajat Adak, Pragya Verma
A hypergraph is \emph{linear} if every pair of vertices is contained in at most one hyperedge. For a family of -uniform hypergraphs, let $\operatorname{ex}^{\mathr…
math.CO2026
Bounds on Linear Turán Number for Trees
Rajat Adak, Pragya Verma
The paper investigates extremal bounds for the linear Turán number of various r‑uniform hypergraph trees, providing constructions and exact upper bounds for specific small trees an…