Some Exact Results and New Asymptotics for Hypergraph Turán Numbers

DOI10.1017/S0963548301005028zbMath1035.05056MaRDI QIDQ3147240

Dhruv Mubayi

Publication date: 2002

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

regular hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (15)

Some extremal results on hypergraph Turán problems ⋮ Small cores in 3-uniform hypergraphs ⋮ Some extremal results on complete degenerate hypergraphs ⋮ Codegree threshold for tiling balanced complete \(3\)-partite \(3\)-graphs and generalized \(4\)-cycles ⋮ Some tight lower bounds for Turán problems via constructions of multi-hypergraphs ⋮ Extremal numbers of hypergraph suspensions of even cycles ⋮ Turán number of special four cycles in triple systems ⋮ Relative Turán Problems for Uniform Hypergraphs ⋮ New lower bounds for Ramsey numbers of graphs and hypergraphs ⋮ On the spectrum of projective norm-graphs ⋮ A universal exponent for homeomorphs ⋮ Codegree Conditions for Tiling Complete k-Partite k-Graphs and Loose Cycles ⋮ The maximum size of hypergraphs without generalized 4-cycles ⋮ A note on the random greedy independent set algorithm ⋮ A hypergraph extension of the bipartite Turán problem

This page was built for publication: Some Exact Results and New Asymptotics for Hypergraph Turán Numbers