Separating edges by linearly many subdivisions
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916796289777664 |
|---|---|
| author | Kontogeorgiou, George Pavez-Signe, Matias Stein, Maya Taruni, S Trujillo-Negrete, Ana |
| author_facet | Kontogeorgiou, George Pavez-Signe, Matias Stein, Maya Taruni, S Trujillo-Negrete, Ana |
| contents | We prove that for any two graphs $G$ and $H$, the edges of $G$ can be strongly separated by a collection of linearly many subdivisions of $H$ and single edges. This confirms a conjecture of Botler and Naia. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_14011 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Separating edges by linearly many subdivisions Kontogeorgiou, George Pavez-Signe, Matias Stein, Maya Taruni, S Trujillo-Negrete, Ana Combinatorics 05C38, 05C83 We prove that for any two graphs $G$ and $H$, the edges of $G$ can be strongly separated by a collection of linearly many subdivisions of $H$ and single edges. This confirms a conjecture of Botler and Naia. |
| title | Separating edges by linearly many subdivisions |
| topic | Combinatorics 05C38, 05C83 |
| url | https://arxiv.org/abs/2506.14011 |