Elizaveta Iarovikova

collaborators

2 papers

math.CO2026

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 $F$ of $[m]^n…

math.CO2025

A complete $t$ -intersection theorem for families of spanning trees

Elizaveta Iarovikova, Andrey Kupavskii

Let $T_{n}$ denote the set of all labelled spanning trees of $K_{n}$ . A family $F \subset T_{n}$ is $t$ -intersecting if for all $A, B \in F$ the trees…

Forbidding just one intersection for short integer sequences

A complete t-intersection theorem for families of spanning trees

A complete $t$ -intersection theorem for families of spanning trees