Non-empty pairwise cross-intersecting families
From MaRDI portal
Publication:6655392
DOI10.1016/J.JCTA.2024.105981MaRDI QIDQ6655392
Publication date: 23 December 2024
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A generalization of a theorem of Kruskal
- Families of finite sets with minimum shadows
- Some best possible inequalities concerning cross-intersecting families
- Erdős-Ko-Rado theorem for \(\{0,\pm 1\}\)-vectors
- Sharp results concerning disjoint cross-intersecting families
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A note on non-empty cross-intersecting families
This page was built for publication: Non-empty pairwise cross-intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6655392)