A note on the structure of Turán densities of hypergraphs
From MaRDI portal
Publication:937246
DOI10.1007/S00373-008-0773-0zbMath1154.05047OpenAlexW2060883190MaRDI QIDQ937246
Publication date: 20 August 2008
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-008-0773-0
Related Items (4)
On substructure densities of hypergraphs ⋮ Non-jumping numbers for 5-uniform hypergraphs ⋮ On jumping densities of hypergraphs ⋮ On non-strong jumping numbers and density structures of hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- 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.
- Generating non-jumping numbers recursively
- 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: A note on the structure of Turán densities of hypergraphs
