A note on traces of set families (Q1937361): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: Zhi-Wei Sun / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Zhi-Wei Sun / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.4636 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:54, 18 April 2024

scientific article
Language Label Description Also known as
English
A note on traces of set families
scientific article

    Statements

    A note on traces of set families (English)
    0 references
    0 references
    28 February 2013
    0 references
    Let \(\mathcal F\) be a family of subsets of \(\{1,\ldots,n\}\). Let \(k>l>0\) and \(l<n\). The author shows that if for any \((n-l)\)-subset \(L\) of \(\{1,\ldots,n\}\), the family of traces \(\mathcal F|_{L}=\{F\cap L:\;F\in\mathcal F\}\) does not contain any chain of length \(k+1\), then \[ |\mathcal F|\leq (k-l+o(1))\binom n{\lfloor n/2\rfloor}, \] and the upper bound is asymptotically tight.
    0 references
    traces of set families
    0 references
    \(k\)-Sperner families
    0 references
    0 references

    Identifiers