On Turán problems for suspension hypergraphs
From MaRDI portal
Cites work
- A note on a Turán-type extremal question on 3-graphs
- An exact result for 3-graphs
- Asymptotic solution for a new class of forbidden r-graphs
- Daisies and other Turán problems
- Erasure list-decodable codes and Turán hypercube problems
- Exact solution of some Turán-type problems
- Extremal numbers of hypergraph suspensions of even cycles
- Forbidding just one intersection
- Generalizations of the removal lemma
- scientific article; zbMATH DE number 5942358 (Why is no real title available?)
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- scientific article; zbMATH DE number 3285073 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs not containing a tight tree with a bounded trunk
- Kalai's conjecture in \(r\)-partite \(r\)-graphs
- Many \(T\) copies in \(H\)-free graphs
- New Turán densities for 3-graphs
- On a problem of K. Zarankiewicz
- On extremal problems of graphs and generalized graphs
- On maximal paths and circuits of graphs
- On the chromatic number, colorings, and codes of the Johnson graph
- On the existence of triangulated spheres in 3-graphs, and related problems
- On the structure of linear graphs
- Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
- The history of degenerate (bipartite) extremal graph problems
- The maximum number of edges in a 3-graph not containing a given star
- The maximum number of triangles in \(C_{2k+1}\)-free graphs
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Turán densities for daisies and hypercubes
- Turán numbers of r-graphs on r + 1 vertices
- Turán numbers of sunflowers
This page was built for publication: On Turán problems for suspension hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6883634)
