scientific article; zbMATH DE number 3924792
From MaRDI portal
Publication:3699700
Let X be a set with n elements and let \(P_ h(X)\) denote the family of h-sets of X. T(n,k,h) denotes the minimum number of h-sets of a family \(F\subset P_ h(X)\) having the property that any k-set of X includes at least an h-set of F. In this paper it is proved that \(T(11,6,3)=16\), \(T(12,6,3)=22\), \(T(10,7,4)=10\), \(T(11,8,4)=8\), \(T(9,6,4)=12\), \(T(10,6,4)=20\), T(13,5,3)\(\leq 52\) and T(15,5,3)\(\leq 89\) by generating with the help of a computer all non-isomorphic systems F having the above-mentioned property.
Recommendations
Cited in
(17)- Lower bounds for Turán's problem
- Precise values of Turan numbers
- On a two-sided Turán problem
- What we know and what we do not know about Turán numbers
- On the Erdős-Hajnal problem for 3-graphs
- On Turán's \((3,4)\)-problem with forbidden subgraphs
- scientific article; zbMATH DE number 4031696 (Why is no real title available?)
- scientific article; zbMATH DE number 4101239 (Why is no real title available?)
- scientific article; zbMATH DE number 4112627 (Why is no real title available?)
- New Turán densities for 3-graphs
- scientific article; zbMATH DE number 638667 (Why is no real title available?)
- scientific article; zbMATH DE number 2094794 (Why is no real title available?)
- Applications of the Semi-Definite Method to the Turán Density Problem for 3-Graphs
- Turán Problems and Shadows III: Expansions of Graphs
- Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3
- An exact result for 3-graphs
- On set systems with a threshold property
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3699700)