Intersecting k-uniform families containing all the k-subsets of a given set
zbMATH Open1295.05250MaRDI QIDQ396872FDOQ396872
Authors: Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih 
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Intersecting \(k\)-uniform families containing a given family
- On large intersecting subfamilies of uniform setfamilies
- scientific article; zbMATH DE number 3875317
- Intersecting families of multisubsets with rank \(k\)
- The number of \(k\)-intersections of an intersecting family of \(r\)-sets
- Some results on intersecting families of subsets
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Uniform intersecting families with large covering number
- Uniform Intersecting Families with Covering Number Restrictions
- An upper bound for the size of a \(k\)-uniform intersecting family with covering number \(k\)
Kneser graph[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Erd%EF%BF%BD%EF%BF%BDs-Ko-Rado+theorem&go=Go Erd��s-Ko-Rado theorem]intersecting familycross-intersecting familyMilner-Hilton theorem
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- The complete nontrivial-intersection theorem for systems of finite sets
- The complete intersection theorem for systems of finite sets
- An Erdös-Ko-Rado theorem for direct products
- Title not available (Why is that?)
- Independent sets in direct products of vertex-transitive graphs
- Title not available (Why is that?)
- The exact bound in the Erdős-Ko-Rado theorem
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdös–Ko–Rado Theorem—22 Years Later
- Some best possible inequalities concerning cross-intersecting families
- Intersecting families in a subset of Boolean lattices
Cited In (21)
- Isomorphism classes of maximal intersecting uniform families are few
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Intersecting families of multisubsets with rank \(k\)
- Erdős-Ko-Rado with conditions on the minimum complementary degree
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton-Milner family
- On the number of maximal intersecting \(k\)-uniform families and further applications of Tuza's set pair method
- Intersecting \(k\)-uniform families containing a given family
- On the intersecting family process
- Almost intersecting families
- Erdős-Ko-Rado theorem for a restricted universe
- On the maximum number of edges in hypergraphs with fixed matching and clique number
- Intersecting families in symmetric unions of direct products of set families
- Maximum degree and diversity in intersecting hypergraphs
- Beyond the Erdős-Ko-Rado theorem
- Structural results for conditionally intersecting families and some applications
- A note on saturation for \(k\)-wise intersecting families
- On the maximum number of distinct intersections in an intersecting family
- On large intersecting subfamilies of uniform setfamilies
- Non-trivial \(d\)-wise intersecting families
- Partitions with certain intersection properties
- Title not available (Why is that?)
This page was built for publication: Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396872)
