Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set

zbMath1295.05250MaRDI QIDQ396872

Bor-Liang Chen, Wei-Tian Li, Ko-Wei Lih, Kuo-Ching Huang

Publication date: 14 August 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p38

zbMATH Keywords

intersecting familyErdős-Ko-Rado theoremcross-intersecting familyKneser graphMilner-Hilton theorem

Mathematics Subject Classification ID

Extremal set theory (05D05)

Related Items (2)

Intersecting \(k\)-uniform families containing a given family ⋮ On the maximum number of edges in hypergraphs with fixed matching and clique number

Cites Work

• Unnamed Item
• Unnamed Item
• Independent sets in direct products of vertex-transitive graphs
• Intersecting families in a subset of Boolean lattices
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• Some best possible inequalities concerning cross-intersecting families
• The complete nontrivial-intersection theorem for systems of finite sets
• An Erdös-Ko-Rado theorem for direct products
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS

This page was built for publication: Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set