Bounds on Linear Tur\'{a}n Number for Trees
Rajat Adak, Pragya Verma

TL;DR
This paper extends bounds on the maximum size of acyclic linear hypergraphs (trees) for higher uniformities, providing new constructions, exact bounds for certain hypertrees, and conjectures on others.
Contribution
It introduces new bounds and characterizations for linear Turán numbers of acyclic hypergraphs across various uniformities, expanding prior work on 3-uniform cases.
Findings
Lower bound for linear Turán number of r-uniform trees with k edges
Exact bound and characterization for hypertrees with four edges
Upper bound for crown hypergraphs and a conjecture for paths
Abstract
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 hypergraph is \emph{-free} if it contains no member of as a subhypergraph. The \emph{linear Tur\'{a}n number} denotes the maximum number of hyperedges in an -free linear -uniform hypergraph on vertices. Gy\'arf\'as, Ruszink\'o, and S\'ark\"ozy~[\emph{Linear Tur\'an numbers of acyclic triple systems}, European J.\ Combin.\ (2022)] initiated the study of bounds on the linear Tur\'an number for acyclic -uniform linear hypergraphs. In this paper, we extend the study of linear Tur\'{a}n numbers for acyclic systems to higher uniformity. We first give a construction for any linear -uniform tree with edges that yields the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
