Intersecting k-uniform families containing all the k-subsets of a given set
From MaRDI portal
(Redirected from Publication:396872)
Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
Intersecting \(k\)-uniform families containing all the \(k\)-subsets of a given set
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\)
Cites work
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3621717 (Why is no real title available?)
- An Erdös-Ko-Rado theorem for direct products
- Erdös–Ko–Rado Theorem—22 Years Later
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Independent sets in direct products of vertex-transitive graphs
- Intersecting families in a subset of Boolean lattices
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Some best possible inequalities concerning cross-intersecting families
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
Cited in
(21)- scientific article; zbMATH DE number 3875317 (Why is no real title available?)
- Intersecting families in \(\begin{pmatrix}[m]\\ \ell\end{pmatrix}\cup\begin{pmatrix}[n]\\ k\end{pmatrix}\)
- Isomorphism classes of maximal intersecting uniform families are few
- 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
- Almost intersecting families
- On the intersecting family process
- Erdős-Ko-Rado theorem for a restricted universe
- Beyond the Erdős-Ko-Rado theorem
- Maximum degree and diversity in intersecting hypergraphs
- 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
- Structural results for conditionally intersecting families and some applications
- On the maximum number of distinct intersections in an intersecting family
- A note on saturation for \(k\)-wise intersecting families
- Non-trivial \(d\)-wise intersecting families
- On large intersecting subfamilies of uniform setfamilies
- Partitions with certain intersection properties
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)
