GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS

DOI10.4134/BKMS.b180808zbMath1423.05112OpenAlexW3029409528MaRDI QIDQ5242395

Shaoqiang Liu, Yue Jian Peng

Publication date: 8 November 2019

Full work available at URL: http://koreascience.or.kr:80/article/JAKO201921467620273.pdf

zbMATH Keywords

hypergraphTurán densityhypergraph Lagrangian

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Related Items (3)

Lagrangian densities of linear forests and Turán numbers of their extensions ⋮ Lagrangian densities of enlargements of matchings in hypergraphs ⋮ Lagrangian densities of short 3-uniform linear paths and Turán numbers of their extensions

Cites Work

• Unnamed Item
• Unnamed Item
• On possible Turán densities
• Extremal problems whose solutions are the blowups of the small Witt- designs
• Asymptotic solution for a new class of forbidden r-graphs
• On substructure densities of hypergraphs
• A note on the jumping constant conjecture of Erdős
• On jumping densities of hypergraphs
• On non-strong jumping numbers and density structures of hypergraphs
• Hypergraphs do not jump
• Lagrangian densities of some sparse hypergraphs and Turán numbers of their extensions
• On extremal problems of graphs and generalized graphs
• Non-jumping numbers for 5-uniform hypergraphs
• Hypergraphs Do Jump
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the structure of linear graphs

This page was built for publication: GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS