Maximum shattering

DOI10.1002/JCD.22005MaRDI QIDQ6898513zbMATH OpenFDO

Authors Noga Alon, Daniel Zhu

Publication date 17 November 2025

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1002/JCD.22005

zbMATH Keywords

extremal set theorycovering arrayhypergraph Lagrangianset shattering

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Hypergraphs (05C65) Extremal set theory (05D05)

Cites work

• scientific article; zbMATH DE number 4103114 (Why is no real title available?)
• scientific article; zbMATH DE number 3489128 (Why is no real title available?)
• scientific article; zbMATH DE number 2053394 (Why is no real title available?)
• scientific article; zbMATH DE number 3365308 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• t-Covering Arrays: Upper Bounds and Poisson Approximations
• A combinatorial problem; stability and order for models and theories in infinitary languages
• Asymptotic size of covering arrays: an application of entropy compression
• Erasure list-decodable codes and Turán hypercube problems
• Families of \(k\)-independent sets
• Maxima for Graphs and a New Proof of a Theorem of Turán
• On the density of families of sets
• On the maximal number of edges in a homogeneous hypergraph not containing prohibited subgraphs
• Qualitative independence and Sperner problems for directed graphs
• Shattering news
• Small arrays of maximum coverage
• Subcube fault-tolerance in hypercubes

This page was built for publication: Maximum shattering

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