An irrational Lagrangian density of a single hypergraph
arXiv:2112.14935
Abstract
The {\em Turán number} of an -uniform graph , denoted by , is the maximum number of edges in an -free -uniform graph on vertices. The {\em Turán density} of is defined as For graphs, Erdős-Stone-Simonovits (\cite{ESi}, \cite{ES}) showed that We know quite few about the Turán 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 density of (the disjoint union of and an edge) is , consequently, the Turán density of the extension of is an irrational number, answering the question of Baber and Talbot.