A note on non-jumping numbers for r-uniform hypergraphs

DOI10.1007/S00373-018-1888-6MaRDI QIDQ1637102zbMATH OpenOpenAlexWikidataFDO

Authors Shaoqiang Liu, Yuejian 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

Erdős jumping constant conjectureextremal problems in hypergraphsLagrangians of uniform hypergraphsTurán density

Mathematics Subject Classification ID

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

Recommendations

• Non-jumping Turán densities of hypergraphs
• A note on the structure of Turán densities of hypergraphs
• Non-jumping numbers for 5-uniform hypergraphs
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• On substructure densities of hypergraphs

Cites work

• A note on the jumping constant conjecture of Erdős
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Hypergraphs do jump
• Hypergraphs do not jump
• Non-jumping numbers for 4-uniform hypergraphs
• Non-jumping numbers for 5-uniform hypergraphs
• On extremal problems of graphs and generalized graphs
• On jumping densities of hypergraphs
• On possible Turán densities
• On substructure densities of hypergraphs
• On the structure of linear graphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.

Cited in

(12)

• On non-strong jumping numbers and density structures of hypergraphs
• Hypergraphs do not jump
• Non-jumping numbers for 5-uniform hypergraphs
• Co-degree density of hypergraphs
• Hypergraphs do jump
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs
• Generating non-jumps from a known one
• 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

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

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