A note on the size of \(\mathscr{N}\)-free families

DOI10.1007/s40879-017-0139-3zbMath1376.06007arXiv1609.02442OpenAlexW2604316691MaRDI QIDQ1677188

Shanise Walker, Ryan R. Martin

Publication date: 10 November 2017

Published in: European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.02442

zbMATH Keywords

extremal set theoryerror-correcting codesforbidden subposets

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Cryptography (94A60) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• No four subsets forming an \(N\)
• Progress on poset-free families of subsets
• A new table of constant weight codes
• Lower bounds for constant weight codes
• On a lemma of Littlewood and Offord

This page was built for publication: A note on the size of \(\mathscr{N}\)-free families