Separating hypergraph Turán densities
From MaRDI portal
Cites work
- An exact result for 3-graphs
- An upper bound for the Turán number \(t_3(n,4)\)
- Constructions of Turán systems that are tight up to a multiplicative constant
- Eine Extremalaufgabe aus der Graphentheorie.
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3843786 (Why is no real title available?)
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 4101239 (Why is no real title available?)
- scientific article; zbMATH DE number 736294 (Why is no real title available?)
- scientific article; zbMATH DE number 1131467 (Why is no real title available?)
- 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
- Hypergraph Turán Problems in l2-Norm
- Hypergraphs accumulate
- On 3-hypergraphs with forbidden 4-vertex configurations
- On possible Turán densities
- On the co-degree threshold for the Fano plane
- On the structure of linear graphs
- Partite Turán-densities for complete \(r\)-uniform hypergraphs on \(r+1\) vertices
- Turán numbers of r-graphs on r + 1 vertices
- Two questions of Erdős on hypergraphs above the Turán threshold
- What we know and what we do not know about Turán numbers
This page was built for publication: Separating hypergraph Turán densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864345)
