For positive integers \(n,t,k\) where \(2 \leq k \leq n,\) and \(t< 2^n\) a family of (non-empty) subsets of \([n]\) is a \((k,t)\) system, if every \(k\)-subset of \([n]\) contains at least \(t\) elements of the family, while every \((k-1)\)-subset of \([n]\) contains at most \(t-1\) elements of the family. This paper determines the order of magnitude of \(m(n,k,t)\) which denotes the minimum size of a \((k,t)\) system. The notion of \((k,t)\) systems came from computer science, and the proof uses an Erdős-Simonovits result from extremal hypergraph theory.
- Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- scientific article; zbMATH DE number 3407723 (Why is no real title available?)
- On frequent sets of Boolean matrices
- Supersaturated graphs and hypergraphs
- What we know and what we do not know about Turán numbers
- On a two-sided Turán problem
- On the Turán density of \(\{1, 3\}\)-hypergraphs
- Turán density of 2-edge-colored bipartite graphs with application on \(\{2, 3\}\)-hypergraphs
- scientific article; zbMATH DE number 4045750 (Why is no real title available?)
- Turán problems on non-uniform hypergraphs
- Upper bounds for Turán numbers
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs
- On set systems with a threshold property
This page was built for publication: Non-uniform Turán-type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484510)
