Generating non-jumping numbers recursively

DOI10.1016/j.dam.2007.09.003zbMath1185.05109OpenAlexW2020259617MaRDI QIDQ944738

Cheng Zhao, Yue Jian Peng

Publication date: 10 September 2008

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

Full work available at URL: https://doi.org/10.1016/j.dam.2007.09.003

zbMATH Keywords

uniform hypergraphsextremal hypergraph problemsLagrangians of uniform graphsnon-jumping numbers

Mathematics Subject Classification ID

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

Related Items (10)

On substructure densities of hypergraphs ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ On possible Turán densities ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A note on the structure of Turán densities of hypergraphs ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ On jumping densities of hypergraphs ⋮ Some Motzkin-Straus type results for non-uniform 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

• Extremal problems whose solutions are the blowups of the small Witt- designs
• 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.
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• Lagrangians of Hypergraphs
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Subgraph densities in hypergraphs
• On the structure of linear graphs

This page was built for publication: Generating non-jumping numbers recursively