Forbidding just one intersection for short integer sequences

Elizaveta Iarovikova, Fedor Noskov, Georgy Sokolov +1

In this paper, we study the famous Erdős--Sós forbidden intersection problem for words over an alphabet of size $m$: what is the maximal size of a subfamily $\mathcal{F}$ of $[m]^n…