An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
From MaRDI portal
Publication:4138732
Cited in
(36)- A short proof of a cross-intersection theorem of Hilton
- Some greedy t-intersecting families of finite sequences
- Combinatorial analysis. (Matrix problems, choice theory)
- Several families with incomparability and complementarity conditions
- Old and new applications of Katona's circle
- On the sum of sizes of overlapping families
- Cross-intersecting subfamilies of levels of hereditary families
- Cross-intersecting families of vectors
- The maximum product of sizes of cross-intersecting families
- The maximum sum and the maximum product of sizes of cross-intersecting families
- Perfect matchings in down-sets
- The maximum sum and product of sizes of cross-intersecting families
- Cross-intersecting families of vectors
- The maximum product of weights of cross-intersecting families
- On ordered set systems and some conjectures related to the erdös–ko–rado theorem and turán's theorem
- Multicolour sunflowers
- Cross-intersecting Erdős-Ko-Rado sets in finite classical polar spaces
- A sharp bound for the product of weights of cross-intersecting families
- A cross‐intersection theorem for subsets of a set
- r$r$‐Cross t$t$‐intersecting families via necessary intersection points
- A product version of the Hilton-Milner-Frankl theorem
- Localized versions of extremal problems
- Families with restricted matching number and multiply covered shadows
- A proof of Frankl's conjecture on cross-union families
- Cross-intersecting families and primitivity of symmetric systems
- Extremal results for graphs avoiding a rainbow subgraph
- Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families
- A note on non-empty cross-intersecting families
- On non-empty cross-\(t\)-intersecting families
- Non-empty pairwise cross-intersecting families
- The maximum sum of sizes of non-empty pairwise cross-intersecting families
- On non-empty cross-intersecting families
- Non-trivial intersecting and non-empty cross-intersecting families of independent sets in graphs
- Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)
- Cross-intersecting sub-families of hereditary families
- Multiple cross-intersecting families of signed sets
This page was built for publication: An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4138732)