For every finite graph H that is not a clique or independent set, a countable H-free graph exists such that any locally finite edit creates an induced copy of H.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Infinite induced-saturated graphs
For every finite graph H that is not a clique or independent set, a countable H-free graph exists such that any locally finite edit creates an induced copy of H.