A bound on the overlap of same-sized subsets

DOI10.1007/S00026-008-0355-0MaRDI QIDQ1021379zbMATH OpenOpenAlexWikidataFDO

Authors Olof Sivertsson, Pierre Flener, Justin Pearson

Publication date 8 June 2009

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00026-008-0355-0

zbMATH Keywords

convexitydouble countingextremal set theory

Mathematics Subject Classification ID

Extremal set theory (05D05)

Recommendations

• A new bound for Erdős’ minimum overlap problem
• Asymptotically tight bounds on subset sums
• On the sum of sizes of overlapping families
• A note on computing set overlap classes
• scientific article; zbMATH DE number 3823793
• An improved bound for the size of the set \(A/A+A\)
• Bounds for the size of sets with the property D(n)
• Covering a set by subsets
• Upper bounds on the size of covering arrays
• On the size of the subset partial order

Cited in

(3)

• Upper bounding overlaps by groupings
• A new bound for Erdős’ minimum overlap problem
• A note on computing set overlap classes

This page was built for publication: A bound on the overlap of same-sized subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1021379)