Using Lagrangians of hypergraphs to find non-jumping numbers. II.

DOI10.1016/J.DISC.2006.09.024zbMath1128.05029OpenAlexW2059144225MaRDI QIDQ879390

Yue Jian Peng

Publication date: 11 May 2007

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

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

zbMATH Keywords

Erdős jumping constant conjectureLagrangian of an \(r\)-uniform graphoptimal vector

Mathematics Subject Classification ID

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

Related Items (9)

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 ⋮ 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

• Unnamed Item
• Unnamed Item
• Extremal problems whose solutions are the blowups of the small Witt- designs
• A note on the jumping constant conjecture of Erdős
• 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
• On the structure of linear graphs

This page was built for publication: Using Lagrangians of hypergraphs to find non-jumping numbers. II.