Year: 2024
Type: article
Abstract: We prove that for every ordered matching $H$ on $t$ vertices, if an ordered $n$-vertex graph $G$ is $\varepsilon$-far from being $H$-free, then $G$ contains $\text{poly}(\varepsilon) n^t$ copies of $H$. This proves a special case of a conjecture of Tomon and the first author. We also generalize this statement to uniform hypergraphs.
DOI: 10.37236/12629
Authors: Lior Gishboliner, Borna Šimić
Institution: ETH Zurich
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4403938623