An irrational Turán density via hypergraph Lagrangian densities (Q2088710): Difference between revisions

Summary: \textit{R. Baber} and \textit{J. Talbot} [ibid. 19, No. 2, Research Paper P22, 21 p. (2012; Zbl 1244.05122)] asked whether there is an irrational Turán density of a single hypergraph. In this paper, we show that the Lagrangian density of a 4-uniform matching of size 3 is an irrational number. \textit{A. F. Sidorenko} [Combinatorica 9, No. 2, 207--215 (1989; Zbl 0732.05031)] showed that the Lagrangian density of an \(r\)-uniform hypergraph \(F\) is the same as the Turán density of the extension of \(F\). Therefore, our result gives a positive answer to the question of Baber and Talbot [loc. cit.]. We also determine the Lagrangian densities of a class of \(r\)-uniform hypergraphs on \(n\) vertices with \(\theta (n^2)\) edges. As far as we know, for every hypergraph \(F\) with known hypergraph Lagrangian density, the number of edges in \(F\) is less than the number of its vertices.