An irrational Lagrangian density of a single hypergraph
Zilong Yan, Yuejian Peng

TL;DR
This paper demonstrates that the Turán density of a specific hypergraph extension is irrational, providing a new example of irrational densities in hypergraph Turán problems and answering an open question.
Contribution
It shows that the Lagrangian density of a particular hypergraph is irrational, establishing the existence of irrational Turán densities for certain hypergraph extensions.
Findings
The Lagrangian density of a specific hypergraph is {a0}/3.
The Ture1n density of the extension of this hypergraph is irrational.
This provides the first example of irrational Ture1n densities for hypergraphs.
Abstract
The {\em Tur\'an number} of an -uniform graph , denoted by , is the maximum number of edges in an -free -uniform graph on vertices. The {\em Tur\'{a}n density} of is defined as For graphs, Erd\H{o}s-Stone-Simonovits (\cite{ESi}, \cite{ES}) showed that We know quite few about the Tur\'an density of an -uniform graph for . Baber and Talbot \cite{BT}, and Pikhurko \cite{Pikhurko2} showed that there is an irrational number in and respectively, disproving a conjecture of Chung and Graham \cite{FG}. Baber and Talbot \cite{BT} asked whether contains an irrational number. In this paper, we show that the Lagrangian…
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
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Graph theory and applications
