Geodesic
Polynomial removal lemma for ordered matchings
The electronic journal of combinatorics, Tome 31 (2024) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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
Classification : 05C70, 05C35, 05C65
Mots-clés : ordered graph, Tomon's conjecture

Lior Gishboliner  1   ; Borna Šimić 

1 ETH Zurich 
@article{10_37236_12629,
     author = {Lior Gishboliner and Borna  \v{S}imi\'c},
     title = {Polynomial removal lemma for ordered matchings},
     journal = {The electronic journal of combinatorics},
     year = {2024},
     volume = {31},
     number = {4},
     doi = {10.37236/12629},
     zbl = {1551.05337},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12629/}
}
TY  - JOUR
AU  - Lior Gishboliner
AU  - Borna  Šimić
TI  - Polynomial removal lemma for ordered matchings
JO  - The electronic journal of combinatorics
PY  - 2024
VL  - 31
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12629/
DO  - 10.37236/12629
ID  - 10_37236_12629
ER  - 
%0 Journal Article
%A Lior Gishboliner
%A Borna  Šimić
%T Polynomial removal lemma for ordered matchings
%J The electronic journal of combinatorics
%D 2024
%V 31
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/12629/
%R 10.37236/12629
%F 10_37236_12629
Lior Gishboliner; Borna  Šimić. Polynomial removal lemma for ordered matchings. The electronic journal of combinatorics, Tome 31 (2024) no. 4. doi: 10.37236/12629

Cité par Sources :