Work

A note on the computational complexity of weak saturation

Year: 2025

Type: article

Abstract: We prove that determining the weak saturation number of a host graph $F$ with respect to a pattern graph $H$ is computationally hard, even when $H$ is the triangle. Our main tool establishes a connection between weak saturation and the shellability of simplicial complexes.

Source: Combinatorics Probability Computing

DOI: 10.1017/s0963548325100187

Authors: Martin Tancer, Mykhaylo Tyomkyn

Institution: Charles University

Language: English

Topic: Limits and Structures in Graph Theory

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,550

OpenAlex ID: W4415244164