A generalization of the Katona theorem for cross t-intersecting families (Q1119578): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / reviewed by
 
Property / reviewed by: Neil H. Williams / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Neil H. Williams / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the geometry of Hamming spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for a theorem of Harper about Hamming-spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite projective spaces and intersecting hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / 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: Q5726070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of a theorem of Kruskal / rank
 
Normal rank

Latest revision as of 15:13, 19 June 2024

scientific article
Language Label Description Also known as
English
A generalization of the Katona theorem for cross t-intersecting families
scientific article

    Statements

    A generalization of the Katona theorem for cross t-intersecting families (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    Let X be an n-element set and let k,t\(\leq n\) be integers. Write \(K^ n_ k\) for the number of at least k-size subsets of X. Let \({\mathcal A}\) and \({\mathcal B}\) be families of subsets of X such that \(| A\cap B| \geq t\) for every A in \({\mathcal A}\) and B in \({\mathcal B}\). In this paper it is shown that (i) If \(n+t=2k\) then \(| {\mathcal A}| | {\mathcal B}| \leq (K^ n_ k)^ 2,\) (ii) If \(n+t=2k-1\) then \[ | {\mathcal A}| | {\mathcal B}| \leq \max \{(K^ n_ k+\left( \begin{matrix} n-1\\ k- 1\end{matrix} \right))^ 2,\quad K^ n_ k K^ n_{k-1}\}. \] These results generalize similar results for the case when \({\mathcal A}={\mathcal B}\) of \textit{G. O. H. Katona} [Acta Math. Acad. Sci. Hung. 15, 329-337 (1964; Zbl 0134.251)].
    0 references
    0 references
    n-element set
    0 references
    k-size subsets
    0 references