On jumping densities of hypergraphs
From MaRDI portal
Publication:968206
DOI10.1007/S00373-010-0874-4zbMATH Open1205.05164OpenAlexW1974100953MaRDI QIDQ968206FDOQ968206
Authors: Yuejian 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
Recommendations
Cites Work
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- Hypergraphs do not jump
- On extremal problems of graphs and generalized graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of linear graphs
- 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
- Subgraph densities in hypergraphs
- On substructure densities of hypergraphs
- A note on the structure of Turán densities of hypergraphs
- A note on non-jumping numbers
Cited In (9)
- On substructure densities of hypergraphs
- On non-strong jumping numbers and density structures of hypergraphs
- On the algebraic and topological structure of the set of Turán densities
- A note on non-jumping numbers for \(r\)-uniform hypergraphs
- Independence densities of hypergraphs
- Non-jumping numbers for 5-uniform hypergraphs
- GENERATING NON-JUMPING NUMBERS OF HYPERGRAPHS
- Generating non-jumps from a known one
- Non-jumping Turán densities of hypergraphs
This page was built for publication: On jumping densities of hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968206)
