On a restricted cross-intersection problem
From MaRDI portal
Publication:855846
Recommendations
Cites work
- scientific article; zbMATH DE number 3957109 (Why is no real title available?)
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- A general 4-words inequality with consequences for 2-way communication complexity
- An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
- Approximating the independence number via the \(\vartheta\)-function
- Bounds on pairs of families with restricted intersections
- Families of Non-disjoint subsets
- Forbidden Intersections
- Intersection theorems with geometric consequences
- Large sets of nearly orthogonal vectors
- On t-designs
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
Cited in
(6)- Disjoint pairs in set systems with restricted intersection
- Almost cross-intersecting and almost cross-Sperner pairs of families of sets
- Uniformly cross intersecting families
- On two set-systems with restricted cross-intersections
- An intersection problem with 6 extremes
- Cross \(\mathcal L\)-intersecting families on set systems
This page was built for publication: On a restricted cross-intersection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855846)