Upper bounds for Turán numbers

DOI10.1006/jcta.1996.2739zbMath0873.05003OpenAlexW2029616558MaRDI QIDQ5961541

Alexander Sidorenko

Publication date: 26 October 1997

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcta.1996.2739

zbMATH Keywords

upper boundsset systemTurán number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Permutations, words, matrices (05A05)

Related Items (12)

Extremal problems on set systems ⋮ On set systems with a threshold property ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ On Turán numbers for disconnected hypergraphs ⋮ Extremal problems in hypergraph colourings ⋮ Colorings of hypergraphs with large number of colors ⋮ Colorings of hypergraphs with large number of colors ⋮ Turán problems on non-uniform hypergraphs ⋮ Minimum number of affine simplices of given dimension ⋮ Asymptotic Bounds for General Covering Designs ⋮ Improved bounds on a generalization of Tuza's conjecture ⋮ An upper bound for the Turán number \(t_3(n,4)\)

This page was built for publication: Upper bounds for Turán numbers