Showing math.COShow all
2 papers · 1 filter
math.CO2026
Linear Turán Numbers of Uniform Hypertrees
Rajat Adak, Pragya Verma
A hypergraph is linear if every pair of vertices is contained in at most one hyperedge. We study linear Turán numbers of acyclic -uniform hypergraphs, extending earlier work of…
math.CO2026
Bounds on Linear Turán Number for Trees
Rajat Adak, Pragya Verma
A hypergraph is said to be \emph{linear} if every pair of vertices lies in at most one hyperedge. Given a family of -uniform hypergraphs, an -uniform hyperg…