Polynomial removal lemma for ordered matchings
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909492300480512 |
|---|---|
| author | Gishboliner, Lior Šimić, Borna |
| author_facet | Gishboliner, Lior Šimić, Borna |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_01652 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Polynomial removal lemma for ordered matchings Gishboliner, Lior Šimić, Borna Combinatorics 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. |
| title | Polynomial removal lemma for ordered matchings |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2307.01652 |