The exact linear Tur\'an number of the Sail
Beka Ergemlidze, Ervin Gy\H{o}ri, Abhishek Methuku

TL;DR
This paper determines the maximum size of 3-uniform linear hypergraphs avoiding a specific 3-fan structure for all cases, completing the characterization of extremal hypergraphs and answering a previously open problem.
Contribution
It solves the open case for the linear Turán number of the Sail hypergraph when n=3k+1, providing exact values and characterizing all extremal hypergraphs.
Findings
Exact linear Turán number for n=3k+1 is k^2+1.
Extremal hypergraphs in this case are non-standard and not derived from transversal designs.
Complete characterization of extremal hypergraphs for all n mod 3.
Abstract
A hypergraph is linear if any two of its edges intersect in at most one vertex. The Sail (or -fan) is the -uniform linear hypergraph consisting of edges pairwise intersecting in the same vertex and an additional edge intersecting all in a vertex different from . The linear Tur\'an number is the maximum number of edges in a -uniform linear hypergraph on vertices that does not contain a copy of . F\"{u}redi and Gy\'arf\'as proved that if , then and the only extremal hypergraphs in this case are transversal designs. They also showed that if , then , and the only extremal hypergraphs are truncated designs (which are obtained from a transversal design on vertices with groups by removing one vertex and all the hyperedges containing…
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.
Taxonomy
TopicsLaw, logistics, and international trade · Maritime Navigation and Safety · Historical Geography and Cartography
