A sharp bound for the number of sets that pairwise intersect at \(k\) positive values

From MaRDI portal
Revision as of 11:59, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1878792

DOI10.1007/s00493-003-0031-2zbMath1045.05087OpenAlexW2050639196MaRDI QIDQ1878792

Hunter S. Snevily

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 (24)

A guide to the graph labeling zooOn generalizations of the deBruijn-Erdős theoremImproved bounds on families under \(k\)-wise set-intersection constraintsA common generalization to theorems on set systems with \(\mathcal L\)-intersectionsIntersection families and Snevily's conjectureSet Systems with L-Intersections and k-Wise L-Intersecting FamiliesUniform hypergraphs under certain intersection constraints between hyperedgesOn the biclique cover of the complete graphOn hierarchically closed fractional intersecting familiesMaximal fractional cross-intersecting familiesA new short proof of the EKR theoremFamilies of vector spaces with \(r\)-wise \(\mathcal{L}\)-intersectionsSet systems with restricted \(k\)-wise \(\mathcal{L}\)-intersections modulo a prime numberRestricted intersecting families on simplicial complexAlon-Babai-Suzuki's conjecture related to binary codes in nonmodular versionFractional \(L\)-intersecting familiesCross \(\mathcal L\)-intersecting families on set systemsAlon-Babai-Suzuki's inequalities, Frankl-Wilson type theorem and multilinear polynomialsSet systems with positive intersection sizesSet systems with \(\mathcal L\)-intersections modulo a prime numberSet systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distancesInvitation to intersection problems for finite setsSet systems with cross \(\mathcal L\)-intersection and \(k\)-wise \(\mathcal L\)-intersecting familiesAn explicit 1-factorization in the middle of the Boolean lattice




This page was built for publication: A sharp bound for the number of sets that pairwise intersect at \(k\) positive values