Subgraph densities in hypergraphs

DOI10.7151/DMGT.1361MaRDI QIDQ5443841zbMATH OpenOpenAlexFDO

Authors Yuejian Peng

Publication date 22 February 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/82af87a6462ca5ac9dfff66c8a722a590b8c17f8

Mathematics Subject Classification ID

Hypergraphs (05C65) Extremal set theory (05D05)

Recommendations

• On substructure densities of hypergraphs
• A note on the structure of Turán densities of hypergraphs
• Using Lagrangians of hypergraphs to find non-jumping numbers. II.
• Non-jumping numbers for 4-uniform hypergraphs
• Hypergraphs do not jump

Cited in

(13)

• Using Lagrangians of hypergraphs to find non-jumping numbers. I
• On non-strong jumping numbers and density structures of hypergraphs
• Hypergraphs do not jump
• Supersaturation for subgraph counts
• Dense subgraphs in the H-free process
• On density of subgraphs of Cartesian products
• Subgraph densities in signed graphons and the local Simonovits-Sidorenko conjecture
• Subgraph densities in a surface
• Generating non-jumps from a known one
• On substructure densities of hypergraphs
• A note on the structure of Turán densities of hypergraphs
• Generating non-jumping numbers recursively
• On jumping densities of hypergraphs

This page was built for publication: Subgraph densities in hypergraphs

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