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)

zbMATH Keywords

set systemsdiadic decomposition

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

(7)

• Constructing Ramsey graphs from Boolean function representations
• On the modulo degree complexity of Boolean functions
• Construction of sparse binary sensing matrices using set systems
• Pairs of codes with prescribed Hamming distances and coincidences
• Co-orthogonal codes
• Set systems with positive intersection sizes
• Constructive upper bounds for intersecting set systems

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)