A note on the computational complexity of weak saturation
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866914105523175424 |
|---|---|
| author | Tancer, Martin Tyomkyn, Mykhaylo |
| author_facet | Tancer, Martin Tyomkyn, Mykhaylo |
| contents | We prove that determining the weak saturation number of a host graph $F$ with respect to a pattern graph $H$ is already a computationally hard problem when $H$ is the triangle. As our main tool we establish a connection between weak saturation and shellability of simplicial complexes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_12096 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A note on the computational complexity of weak saturation Tancer, Martin Tyomkyn, Mykhaylo Combinatorics We prove that determining the weak saturation number of a host graph $F$ with respect to a pattern graph $H$ is already a computationally hard problem when $H$ is the triangle. As our main tool we establish a connection between weak saturation and shellability of simplicial complexes. |
| title | A note on the computational complexity of weak saturation |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2501.12096 |