Non-jumping numbers for 4-uniform hypergraphs

DOI10.1007/S00373-006-0689-5zbMath1115.05045OpenAlexW2062262086MaRDI QIDQ878060

Yue Jian Peng

Publication date: 26 April 2007

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

Full work available at URL: https://doi.org/10.1007/s00373-006-0689-5

Mathematics Subject Classification ID

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

Related Items (8)

A note on non-jumping numbers for \(r\)-uniform hypergraphs ⋮ On substructure densities of hypergraphs ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ A note on the structure of Turán densities of hypergraphs ⋮ Generating non-jumping numbers recursively ⋮ On jumping densities of hypergraphs ⋮ On non-strong jumping numbers and density structures of hypergraphs ⋮ On the algebraic and topological structure of the set of Turán densities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the jumping constant conjecture of Erdős
• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• On the structure of linear graphs

This page was built for publication: Non-jumping numbers for 4-uniform hypergraphs