On jumping densities of hypergraphs

DOI10.1007/S00373-010-0874-4zbMath1205.05164OpenAlexW1974100953MaRDI QIDQ968206

Yue Jian Peng

Publication date: 5 May 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-010-0874-4

zbMATH Keywords

extremal problems in hypergraphsTurán densityErdős jumping constant conjecture

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Density (toughness, etc.) (05C42)

Related Items (8)

A note on non-jumping numbers for \(r\)-uniform hypergraphs ⋮ On substructure densities of hypergraphs ⋮ Independence densities of hypergraphs ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS ⋮ 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
• Unnamed Item
• Unnamed Item
• On substructure densities of hypergraphs
• 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.
• A note on the structure of Turán densities of hypergraphs
• Generating non-jumping numbers recursively
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• Hypergraphs do not jump
• On extremal problems of graphs and generalized graphs
• Subgraph densities in hypergraphs
• On the structure of linear graphs

This page was built for publication: On jumping densities of hypergraphs