paper

Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions

arXiv:1902.07134

Abstract

For a fixed positive integer and an -uniform hypergraph , the Turán number is the maximum number of edges in an -free -uniform hypergraph on vertices, and the Lagrangian density of is defined as , where is the Lagrangian of . For an -uniform hypergraph on vertices, it is clear that . We say that an -uniform hypergraph on vertices is perfect if . Let be the linear -uniform path of length , that is, , and if . We show that and are perfect, this supports a conjecture in \cite{yanpeng} proposing that all -uniform linear hypergraphs are perfect. Applying the results on Lagrangian densities, we determine the Turán numbers of their extensions.

17 pages, 6 figures. arXiv admin note: text overlap with arXiv:1609.08983; text overlap with arXiv:1510.03461 by other authors

References in corpus (1)