A sharp bound for the number of sets that pairwise intersect at \(k\) positive values
From MaRDI portal
Publication:1878792
DOI10.1007/s00493-003-0031-2zbMath1045.05087OpenAlexW2050639196MaRDI QIDQ1878792
Publication date: 8 September 2004
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-003-0031-2
Related Items
A guide to the graph labeling zoo, On generalizations of the deBruijn-Erdős theorem, Improved bounds on families under \(k\)-wise set-intersection constraints, A common generalization to theorems on set systems with \(\mathcal L\)-intersections, Intersection families and Snevily's conjecture, Set Systems with L-Intersections and k-Wise L-Intersecting Families, Uniform hypergraphs under certain intersection constraints between hyperedges, On the biclique cover of the complete graph, On hierarchically closed fractional intersecting families, Maximal fractional cross-intersecting families, A new short proof of the EKR theorem, Families of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersections, Set systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime number, Restricted intersecting families on simplicial complex, Alon-Babai-Suzuki's conjecture related to binary codes in nonmodular version, Fractional \(L\)-intersecting families, Cross \(\mathcal L\)-intersecting families on set systems, Alon-Babai-Suzuki's inequalities, Frankl-Wilson type theorem and multilinear polynomials, Set systems with positive intersection sizes, Set systems with \(\mathcal L\)-intersections modulo a prime number, Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances, Invitation to intersection problems for finite sets, Set systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting families, An explicit 1-factorization in the middle of the Boolean lattice
