The Turán number \(T(n,k,r)\) is the minimum size of a system of \(r\)-subsets of an \(n\)-set such that every \(k\)-subset contains at least one of the members of the system. The paper gives asymptotic upper bounds for these numbers. Constructive upper bounds in case that \(k=2r+1\) have been given by \textit{D. de Caen} et al. [Congr. Numerantium 65, 277-280 (1988; Zbl 0671.05003)].
Recommendations
Cited in
(24)- An upper bound for the Turán number \(t_3(n,4)\)
- What we know and what we do not know about Turán numbers
- Some sharp results on the generalized Turán numbers
- Improved bounds on a generalization of Tuza's conjecture
- Tournaments, 4-uniform hypergraphs, and an exact extremal result
- Non-uniform Turán-type problems
- scientific article; zbMATH DE number 4097380 (Why is no real title available?)
- Constructive Upper Bounds for the Turán Number
- Extremal problems on set systems
- Turán problems on non-uniform hypergraphs
- Minimum number of affine simplices of given dimension
- Extremal problems in hypergraph colourings
- Regular Tur\'an numbers
- Asymptotic bounds for general covering designs
- Colorings of hypergraphs with large number of colors
- Colorings of hypergraphs with large number of colors
- On Turán numbers for disconnected hypergraphs
- Generalized Tuza's conjecture for random hypergraphs
- Turán numbers of r-graphs on r + 1 vertices
- A note on the minimum size of Turán systems
- On CNF formulas irredundant with respect to unit clause propagation
- Approximate hypergraph vertex cover and generalized Tuza's conjecture
- Constructions of Turán systems that are tight up to a multiplicative constant
- On set systems with a threshold property
This page was built for publication: Upper bounds for Turán numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961541)
