A generalization of a theorem of Kruskal (Q1073037): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A generalization of a combinatorial theorem of macaulay / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado from Kruskal-Katona / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of the Kruskal-Katona theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new short proof for the Kruskal-Katona theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-trivial intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of milner on k-graphs with non-disjoint edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem in the k-Adic Number System / rank
 
Normal rank

Latest revision as of 13:22, 17 June 2024

scientific article
Language Label Description Also known as
English
A generalization of a theorem of Kruskal
scientific article

    Statements

    A generalization of a theorem of Kruskal (English)
    0 references
    0 references
    1985
    0 references
    For a set \({\mathcal A}\) of k-subsets of \(\{\) 1,...,n\(\}\) with \(| {\mathcal A}| \geq \lceil n/k\rceil\), \(\cup_{A\in {\mathcal A}}A=\{1,...,n\}\) the author determines the minimal cardinality of the \(\ell\)-shadow of \({\mathcal A}\), i.e. of the set of \(\ell\)-sets contained in the sets of \({\mathcal A}\). His result generalizes the Kruskal-Katona-Lindström theorem (KKL theorem) [see e.g. \textit{P. Frankl}, Discrete Math. 48, 327-329 (1984; Zbl 0539.05006)] by imposing the additional condition \(\cup_{A\in {\mathcal A}}A=\{1,...,n\}\). A necessary and sufficient condition is also given for the uniqueness of the solution in the KKL theorem.
    0 references
    0 references
    0 references
    finite set
    0 references
    intersection theorems
    0 references
    k-subsets
    0 references
    \(\ell \)-shadow
    0 references
    Kruskal- Katona-Lindström theorem
    0 references
    0 references