On a restricted cross-intersection problem
From MaRDI portal
Publication:855846
DOI10.1016/J.JCTA.2005.10.008zbMATH Open1108.05089OpenAlexW2122868591MaRDI QIDQ855846FDOQ855846
Authors: Peter Keevash, Benny 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
Recommendations
Cites Work
- Forbidden Intersections
- Title not available (Why is that?)
- Intersection theorems with geometric consequences
- Title not available (Why is that?)
- The Lovász Theta Function and a Semidefinite Programming Relaxation of Vertex Cover
- Approximating the independence number via the \(\vartheta\)-function
- On t-designs
- Families of Non-disjoint subsets
- Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
- Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
- 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
- Large sets of nearly orthogonal vectors
- Bounds on pairs of families with restricted intersections
Cited In (6)
- Cross \(\mathcal L\)-intersecting families on set systems
- Uniformly cross intersecting families
- On two set-systems with restricted cross-intersections
- Disjoint pairs in set systems with restricted intersection
- Almost cross-intersecting and almost cross-Sperner pairs of families of sets
- An intersection problem with 6 extremes
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)
