On substructure densities of hypergraphs

DOI10.1007/S00373-009-0859-3zbMath1211.05095OpenAlexW2032287813MaRDI QIDQ844225

Yue Jian Peng

Publication date: 18 January 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-009-0859-3

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 (5)

A note on non-jumping numbers for \(r\)-uniform hypergraphs ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS ⋮ On jumping densities of hypergraphs ⋮ Some Motzkin-Straus type results for non-uniform hypergraphs

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.
• A note on the structure of Turán densities of hypergraphs
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• On non-strong jumping numbers and density structures of hypergraphs
• 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: On substructure densities of hypergraphs