Generating non-jumps from a known one
From MaRDI portal
Recommendations
Cites work
- A note on non-jumping numbers
- A note on the jumping constant conjecture of Erdős
- Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
- Generating non-jumping numbers recursively
- scientific article; zbMATH DE number 3224335 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Hypergraph Turán densities can have arbitrarily large algebraic degree
- Hypergraphs do jump
- Hypergraphs do not jump
- Non-jumping numbers for 4-uniform hypergraphs
- Non-jumping Turán densities of hypergraphs
- On extremal problems of graphs and generalized graphs
- On jumping densities of hypergraphs
- On possible Turán densities
- On some extremal problems on r-graphs
- On the algebraic and topological structure of the set of Turán densities
- On the structure of linear graphs
- Subgraph densities in hypergraphs
- The maximum size of 3-uniform hypergraphs not containing a Fano plane
- The Turán number of the Fano plane
- Triple Systems Not Containing a Fano Configuration
- Using Lagrangians of hypergraphs to find non-jumping numbers. I
- Using Lagrangians of hypergraphs to find non-jumping numbers. II.
This page was built for publication: Generating non-jumps from a known one
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6649849)
