Focal-free uniform hypergraphs and codes

DOI10.1016/J.JCTA.2026.106193MaRDI QIDQ7285317zbMATH OpenFDO

Authors Xinqi Huang, Chong Shangguan, Xian De Zhang, Yuhao Zhao

Publication date 19 June 2026

Published in (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTA.2026.106193

Mathematics Subject Classification ID

No records found.

Cites work

• A General Intersection Theorem For Finite Sets
• An improved upper bound for the size of a sunflower-free family
• Asymptotic behavior of the chromatic index for hypergraphs
• Coding for Sunflowers
• Combinatorial properties of systems of sets
• Degenerate Turán densities of sparse hypergraphs
• Disjoint systems
• Extremal combinatorics. With applications in computer science
• Families of finite sets in which no set is covered by the union of \(r\) others
• Frameproof Codes
• scientific article; zbMATH DE number 4104975 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• Improved bounds for the sunflower lemma
• Improved Constructions of Frameproof Codes
• Intersection statements for systems of sets
• Intersection Theorems for Systems of Sets
• Near optimal probabilistic constructions of frameproof codes
• Near perfect coverings in graphs and hypergraphs
• Near-sunflowers and focal families
• Note on sunflowers
• On a packing and covering problem
• Polynomial Codes Over Certain Finite Fields
• The CRC handbook of combinatorial designs
• The Erdős matching conjecture and concentration inequalities
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• UPPER BOUNDS FOR SUNFLOWER-FREE SETS

This page was built for publication: Focal-free uniform hypergraphs and codes

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