On a restricted cross-intersection problem
From MaRDI portal
Publication:855846
DOI10.1016/j.jcta.2005.10.008zbMath1108.05089OpenAlexW2122868591MaRDI QIDQ855846
Peter Keevash, Benjamin Sudakov
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2005.10.008
Related Items (3)
Almost cross-intersecting and almost cross-Sperner pairs of families of sets ⋮ Disjoint pairs in set systems with restricted intersection ⋮ Uniformly cross intersecting families
Cites Work
- Unnamed Item
- Unnamed Item
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
- A general 4-words inequality with consequences for 2-way communication complexity
- Intersection theorems with geometric consequences
- On t-designs
- Large sets of nearly orthogonal vectors
- Approximating the independence number via the \(\vartheta\)-function
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Bounds on pairs of families with restricted intersections
- Forbidden Intersections
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- Families of Non-disjoint subsets
This page was built for publication: On a restricted cross-intersection problem