Exact solution of some Turán-type problems (Q1112819): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Peter Frankl / rank
 
Normal rank
Property / author
 
Property / author: Zoltan Fueredi / rank
 
Normal rank

Revision as of 03:11, 10 February 2024

scientific article
Language Label Description Also known as
English
Exact solution of some Turán-type problems
scientific article

    Statements

    Exact solution of some Turán-type problems (English)
    0 references
    1987
    0 references
    Fifteen years ago Chvátal conjectued that if \({\mathcal F}\) is a family of k subsets of an n-set, \(| {\mathcal F}| >\left( \begin{matrix} n-1\\ k- 1\end{matrix} \right)\), d is an arbitrary integer with \(d\leq k-1\) and \((d+1)k\leq dn\), then there exist \(d+1\) sets in \({\mathcal F}\) with empty intersection such that the intersection of any d of them is non-empty. The validity of this conjecture is established for \(n\geq n_ 0(k)\), in a more general framework. Another problem which is solved asymptotically is when the excluded configuration is a fixed sunflower.
    0 references
    family of subsets
    0 references
    empty intersection
    0 references
    excluded configuration
    0 references
    fixed sunflower
    0 references
    0 references
    0 references

    Identifiers