On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
From MaRDI portal
Publication:1865379
DOI10.1006/jcta.2002.3264zbMath1013.05085OpenAlexW2119135810MaRDI QIDQ1865379
Vince Grolmusz, Benjamin Sudakov
Publication date: 26 March 2003
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.2002.3264
Related Items (23)
Pairs of codes with prescribed Hamming distances and coincidences ⋮ Improved bounds on families under \(k\)-wise set-intersection constraints ⋮ A common generalization to theorems on set systems with \(\mathcal L\)-intersections ⋮ A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\) ⋮ Uniform hypergraphs under certain intersection constraints between hyperedges ⋮ Restricted \(t\)-wise \(\mathcal{L}\)-intersecting families on set systems ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ Maximal fractional cross-intersecting families ⋮ Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections ⋮ Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number ⋮ Almost-Fisher families ⋮ Extremal set systems with restricted \(k\)-wise intersections. ⋮ Non-trivial \(d\)-wise intersecting families ⋮ Ryser's conjecture for \(t\)-intersecting hypergraphs ⋮ Almost-Fisher families ⋮ Fractional \(L\)-intersecting families ⋮ Cross \(\mathcal L\)-intersecting families on set systems ⋮ Set systems with positive intersection sizes ⋮ Flattening rank and its combinatorial applications ⋮ Set systems with \(\mathcal L\)-intersections modulo a prime number ⋮ Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances ⋮ Multiply intersecting families of sets ⋮ Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families
Cites Work
- On functions of strength t
- On finite set-systems whose every intersection is a kernel of a star
- Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
- Intersection theorems with geometric consequences
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- On t-designs
- A new proof of several inequalities on codes and sets
- Extremal set systems with weakly restricted intersections
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
