A note on the computational complexity of weak saturation
Combinatorics
2025-10-22 v1
Abstract
We prove that determining the weak saturation number of a host graph with respect to a pattern graph is already a computationally hard problem when is the triangle. As our main tool we establish a connection between weak saturation and shellability of simplicial complexes.
Keywords
Cite
@article{arxiv.2501.12096,
title = {A note on the computational complexity of weak saturation},
author = {Martin Tancer and Mykhaylo Tyomkyn},
journal= {arXiv preprint arXiv:2501.12096},
year = {2025}
}