Prefer a chat interface with context about you and your work?
$P_{n}$-Induced-Saturated Graphs Exist for all $n \geqslant 6$
Let $P_{n}$ be a path graph on $n$ vertices. We say that a graph $G$ is $P_{n}$-induced-saturated if $G$ contains no induced copy of $P_{n}$, but deleting any edge of $G$ as well as adding to $G$ any edge of $G^{c}$ creates such a copy. Martin and Smith (2012) showed …