A note on non-jumping numbers for \(r\)-uniform hypergraphs

DOI10.1007/s00373-018-1888-6zbMath1388.05129OpenAlexW2790720322MaRDI QIDQ1637102

Shaoqiang Liu, Yue Jian Peng

Publication date: 7 June 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1888-6

zbMATH Keywords

extremal problems in hypergraphsTurán densityErdős jumping constant conjectureLagrangians of uniform hypergraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Cites Work

• Unnamed Item
• On possible Turán densities
• On substructure densities of hypergraphs
• A note on the jumping constant conjecture of Erdős
• Non-jumping numbers for 4-uniform hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• On jumping densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• Non-jumping numbers for 5-uniform hypergraphs
• Hypergraphs Do Jump
• On the structure of linear graphs

This page was built for publication: A note on non-jumping numbers for \(r\)-uniform hypergraphs