On non-strong jumping numbers and density structures of hypergraphs

DOI10.1016/j.disc.2008.11.007zbMath1211.05061OpenAlexW1988764585MaRDI QIDQ1043558

Cheng Zhao, Yue Jian Peng

Publication date: 9 December 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.11.007

zbMATH Keywords

extremal problems in hypergraphsTurán densityErdős jumping constant conjecture

Mathematics Subject Classification ID

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

Related Items (2)

On substructure densities of hypergraphs ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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.
• A note on the structure of Turán densities of hypergraphs
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Hypergraphs do not jump
• What we know and what we do not know about Turán numbers
• On extremal problems of graphs and generalized graphs
• Subgraph densities in hypergraphs
• On the structure of linear graphs

This page was built for publication: On non-strong jumping numbers and density structures of hypergraphs