Constructing set systems with prescribed intersection sizes

DOI10.1016/S0196-6774(02)00204-3MaRDI QIDQ4805399zbMATH OpenFDO

Authors Vince Grolmusz

Publication date 14 May 2003

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0196-6774(02)00204-3

zbMATH Keywords

diadic decompositionset systems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1088263
• Superpolynomial size set-systems with restricted intersections mod 6 and explicit Ramsey graphs
• Constructive upper bounds for intersecting set systems
• Constructing Large Set Systems with Given Intersection Sizes Modulo Composite Numbers
• Set systems with three intersections

Cited in

(8)

• Set systems with positive intersection sizes
• Co-orthogonal codes
• Constructive upper bounds for intersecting set systems
• Construction of sparse binary sensing matrices using set systems
• Constructing Ramsey graphs from Boolean function representations
• On the modulo degree complexity of Boolean functions
• On the degree of Boolean functions as polynomials over \(\mathbb{Z}_m\)
• Pairs of codes with prescribed Hamming distances and coincidences

This page was built for publication: Constructing set systems with prescribed intersection sizes

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