A note on the jumping constant conjecture of Erdős

DOI10.1016/J.JCTB.2006.05.004zbMATH Open1110.05052OpenAlexW2030153168MaRDI QIDQ864899FDOQ864899

Authors: Vojtěch Rödl, John Talbot, Peter Frankl, Yuejian 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

Recommendations

• Non-jumping numbers for 5-uniform hypergraphs
• On substructure densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• A note on non-jumping numbers for \(r\)-uniform hypergraphs
• Hypergraphs do not jump

zbMATH Keywords

jump numberextremal hypergraph problemsErdős-Stone-Simonovits theorem

Mathematics Subject Classification ID

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

Cites Work

• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• Title not available (Why is that?)
• On the structure of linear graphs
• Co-degree density of hypergraphs

Cited In (24)

• Some Motzkin-Straus type results for non-uniform hypergraphs
• Non-jumping numbers for 4-uniform hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs
• On substructure densities of hypergraphs
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• On non-strong jumping numbers and density structures of hypergraphs
• On the algebraic and topological structure of the set of Turán densities
• On possible Turán densities
• Hypergraph Turán densities can have arbitrarily large algebraic degree
• A note on non-jumping numbers for \(r\)-uniform hypergraphs
• Hypergraphs do jump
• A note on the structure of Turán densities of hypergraphs
• Non-jumping numbers for 5-uniform hypergraphs
• Co-degree density of hypergraphs
• On the jumping constant conjecture for multigraphs
• GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
• A note on non-jumping numbers
• Generating non-jumps from a known one
• An irrational Lagrangian density of a single hypergraph
• Jumps and nonjumps in multigraphs
• Estimates for \(F\)-jumping numbers and bounds for Hartshorne-Speiser-Lyubeznik numbers
• Non-jumping Turán densities of hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864899)