An irrational Lagrangian density of a single hypergraph

Abstract: The {em Tur'an number} of an

r

-uniform graph

F

, denoted by

e x (n, F)

, is the maximum number of edges in an

F

-free

r

-uniform graph on

n

vertices. The {em Tur'{a}n density} of

F

is defined as

p i (F) = u n d e r s e t n i g h t a r r o w i n f t y l i m e x (n, F) o v e r n c h o o s e r .

For graphs, ErdH{o}s-Stone-Simonovits (cite{ESi}, cite{ES}) showed that

P i_{i n f t y}^{(2)} = P i_{f i n}^{(2)} = P i_{1}^{(2)} = 0, 1 o v e r 2, 2 o v e r 3, l d o t s, l - 1 o v e r l, ... .

We know quite few about the Tur'an density of an

r

-uniform graph for

r g e 3

. Baber and Talbot cite{BT}, and Pikhurko cite{Pikhurko2} showed that there is an irrational number in

P i_{3}^{(3)}

and

P i_{f i n}^{(3)}

respectively, disproving a conjecture of Chung and Graham cite{FG}. Baber and Talbot cite{BT} asked whether

P i_{1}^{(r)}

contains an irrational number. In this paper, we show that the Lagrangian density of

F = 123, 124, 134, 234, 567

(the disjoint union of

K_{4}^{3}

and an edge) is

s q r t 3 o v e r 3

, consequently, the Tur'an density of the extension of

F

is an irrational number, answering the question of Baber and Talbot.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: An irrational Lagrangian density of a single hypergraph