Work

An Erdős–ko–rado Theorem for Binary Codes

Year: 2026
Type: article
Abstract: We study intersecting families of words from the Erdős–Ko–Rado perspective. When the alphabet size is 2 $2$ 2 , a maximum intersecting family is not necessarily a star. However, we prove that every maximum 3 $3$ 3 -wise intersecting family is a star. We also present a new proof of the known result for alphabets of size at least 3 $3$ 3 : maximum intersecting families of words are exactly the stars.
Language: English
Open Access status: gold
Estimated APC paid: $3,550
OpenAlex ID: W7164943724
FWCI:
Cites: 8
Cited by:
Related to: