r$r$‐Cross t$t$‐intersecting families via necessary intersection points
From MaRDI portal
Publication:6096797
DOI10.1112/blms.12803arXiv2010.11928OpenAlexW4321369793WikidataQ122655665 ScholiaQ122655665MaRDI QIDQ6096797
Bjarne Schülke, Yannick Mogge, Pranshu Gupta, Simón Piga
Publication date: 15 September 2023
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11928
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A size-sensitive inequality for cross-intersecting families
- Cross-intersecting families and primitivity of symmetric systems
- The complete intersection theorem for systems of finite sets
- The exact bound in the Erdős-Ko-Rado theorem
- The exact bound in the Erdős-Ko-Rado theorem for cross-intersecting families
- On the hardness of approximating minimum vertex cover
- Beyond the Erdős-Ko-Rado theorem
- Some best possible inequalities concerning cross-intersecting families
- Contributions to the geometry of Hamming spaces
- The diametric theorem in Hamming spaces---optimal anticodes
- More complete intersection theorems
- Nontrivial independent sets of bipartite graphs and cross-intersecting families
- The maximum sum of sizes of cross-intersecting families of subsets of a set
- The maximum product of sizes of cross-intersecting families
- The weighted complete intersection theorem
- The maximum sum and the maximum product of sizes of cross-intersecting families
- Analogues of Katona's and Milner's theorems for two families
- The maximum product of weights of cross-intersecting families
- On r-Cross Intersecting Families of Sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- An Intersection Theorem for a Collection of Families of Subsets of a Finite Set
- Extremal Problems for Finite Sets
- A cross‐intersection theorem for subsets of a set
- Uniform s-Cross-Intersecting Families
- A cross-intersection theorem for vector spaces based on semidefinite programming
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A new generalization of the Erdős-Ko-Rado theorem
- A pushing-pulling method: New proofs of intersection theorems