Constructing Finite Sets With Given Intersections

DOI10.1016/S0304-0208(08)73400-5MaRDI QIDQ3674668zbMATH OpenFDO

Authors Peter Frankl

Publication date 1983

Published in Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-0208(08)73400-5

zbMATH Keywords

(n,k,P)-systemcomposite modulifamily of subsets

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Cited in

(5)

• All rationals occur as exponents
• Set systems with restricted intersections modulo prime powers
• Determination of the residue classes of a polynomial at integral arguments
• Improved polynomial secret-sharing schemes
• Invitation to intersection problems for finite sets

This page was built for publication: Constructing Finite Sets With Given Intersections

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