A note on the jumping constant conjecture of Erdős

DOI10.1016/J.JCTB.2006.05.004zbMath1110.05052OpenAlexW2030153168MaRDI QIDQ864899

Vojtěch Rödl, John Talbot, Peter Frankl, Yue Jian Peng

Publication date: 13 February 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.05.004

zbMATH Keywords

jump numberextremal hypergraph problemsErdős-Stone-Simonovits theorem

Mathematics Subject Classification ID

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

Related Items (19)

A note on non-jumping numbers for \(r\)-uniform hypergraphs ⋮ On substructure densities of hypergraphs ⋮ Co-degree density of hypergraphs ⋮ An Irrational Lagrangian Density of a Single Hypergraph ⋮ Non-jumping numbers for 4-uniform hypergraphs ⋮ Using Lagrangians of hypergraphs to find non-jumping numbers. II. ⋮ Hypergraph Turán densities can have arbitrarily large algebraic degree ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS ⋮ On possible Turán densities ⋮ A note on the structure of Turán densities of hypergraphs ⋮ Generating non-jumping numbers recursively ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ On jumping densities of hypergraphs ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs ⋮ Hypergraphs Do Jump ⋮ On non-strong jumping numbers and density structures of hypergraphs ⋮ Non-jumping Turán densities of hypergraphs ⋮ On the algebraic and topological structure of the set of Turán densities

Cites Work

• Unnamed Item
• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• Co-degree density of hypergraphs
• On the structure of linear graphs

This page was built for publication: A note on the jumping constant conjecture of Erdős