Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
From MaRDI portal
Publication:3147240
DOI10.1017/S0963548301005028zbMATH Open1035.05056MaRDI QIDQ3147240FDOQ3147240
Authors: Dhruv Mubayi
Publication date: 2002
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Recommendations
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Cited In (29)
- Relative Turán Problems for Uniform Hypergraphs
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Turán number of special four cycles in triple systems
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- 4-books of three pages
- Keller–Osserman estimates and removability result for the anisotropic porous medium equation with gradient absorption term
- On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
- Some extremal results on hypergraph Turán problems
- The Turán problem for hypergraphs on fixed size
- Asymptotic solution of the Turán problem for some hypergraphs
- On a hypergraph Turán problem of Frankl
- The maximum size of hypergraphs without generalized 4-cycles
- Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles
- The automorphism group of projective norm graphs
- A universal exponent for homeomorphs
- On the spectrum of projective norm-graphs
- Extremal numbers of hypergraph suspensions of even cycles
- Small cores in 3-uniform hypergraphs
- Some extremal results on complete degenerate hypergraphs
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs
- A hypergraph extension of the bipartite Turán problem
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- Turán numbers for Berge-hypergraphs and related extremal problems
- A note on the random greedy independent set algorithm
- Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles
- A new approach to Turán's conjecture
- Turán number of generalized triangles
- An exact Turán result for the generalized triangle
- New Turán Exponents for Two Extremal Hypergraph Problems
This page was built for publication: Some Exact Results and New Asymptotics for Hypergraph Turán Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3147240)