Strong Jumps and Lagrangians of Non-Uniform Hypergraphs

arXiv1403.1220MaRDI QIDQ6249554FDOQ6249554

Linyuan Lu, J. Travis Johnston

Publication date: 5 March 2014

Abstract: The hypergraph jump problem and the study of Lagrangians of uniform hypergraphs are two classical areas of study in the extremal graph theory. In this paper, we refine the concept of jumps to strong jumps and consider the analogous problems over non-uniform hypergraphs. Strong jumps have rich topological and algebraic structures. The non-strong-jump values are precisely the densities of the hereditary properties, which include the Tur'an densities of families of hypergraphs as special cases. Our method uses a generalized Lagrangian for non-uniform hypergraphs. We also classify all strong jump values for $1,2$-hypergraphs.

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

This page was built for publication: Strong Jumps and Lagrangians of Non-Uniform Hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6249554)