Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
From MaRDI portal
Recommendations
Cited in
(24)- Some intersection theorems
- Intersection theorems and mod p rank of inclusion matrices
- Multicoloured extremal problems
- Several families with incomparability and complementarity conditions
- Covering symmetric sets of the Boolean cube by affine hyperplanes
- Some lower bounds for the \(L\)-intersection number of graphs
- Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number
- Lower bound on the profile of degree pairs in cross-intersecting set systems
- Constructive upper bounds for intersecting set systems
- On the rank of higher inclusion matrices
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials
- Random low-degree polynomials are hard to approximate
- Multicolour sunflowers
- Parity helps to compute majority
- On the bias of Reed-Muller codes over odd prime fields
- Inclusion matrices for rainbow subsets
- A robust version of Hegedűs's lemma, with applications
- Property testing with online adversaries
- Hilbert functions and low-degree randomness extractors
- Learning a mixture of two subspaces over finite fields
- Property testing with online adversaries
- Low-degree polynomials are good extractors
- On a restricted cross-intersection problem
- Shadows and intersections: Stability and new proofs
This page was built for publication: Set Systems with Restricted Cross-Intersections and the Minimum Rank ofInclusion Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317582)