From the 1 of 11 linked papers with an AI index.
11 papers
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…
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…
An Upper Bound on the Linear Turán Number of -Crowns
Rajat Adak
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 (also called -graph…
Off-diagonal Rado numbers for and
Rajat Adak, Yash Bakshi, L. Sunil Chandran +1
The study of Ramsey-type problems for linear equations originated with Schur's theorem and was later placed in a systematic framework by Richard Rado. In the off-diagonal setting,…
Localization: A Framework to Generalize Extremal Graph Problems
Rajat Adak, L. Sunil Chandran
Extremal graph theory studies the maximum or minimum number of subgraphs isomorphic to a prescribed graph under given constraints. \textit{Localization} has recently emerged as a f…
Off-diagonal Rado number for and
Rajat Adak, Yash Bakshi, L. Sunil Chandran +1
Ramsey-type problems for linear equations began with Schur's theorem and were systematically generalized by Richard Rado. In the off-diagonal framework for two colors, one consider…