Minimal hypergraph non-jumps

DOI10.1016/J.EJC.2026.104400MaRDI QIDQ7302247zbMATH OpenFDO

Authors Benedict Randall Shaw

Publication date 22 July 2026

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJC.2026.104400

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Cites work

• A note on the jumping constant conjecture of Erdős
• Algorithmic Solution of Extremal Digraph Problems
• Generating non-jumping numbers recursively
• Generating non-jumps from a known one
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• Hypergraphs do jump
• Hypergraphs do not jump
• Jumps and nonjumps in multigraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Non-jumping numbers for 4-uniform hypergraphs
• Non-jumping numbers for 5-uniform hypergraphs
• Non-jumping Turán densities of hypergraphs
• On 3-hypergraphs with forbidden 4-vertex configurations
• On jumping densities of hypergraphs
• On possible Turán densities
• On some extremal problems on r-graphs
• On the jumping constant conjecture for multigraphs
• On the structure of linear graphs
• Subgraph densities in hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.

This page was built for publication: Minimal hypergraph non-jumps

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