For a graph $H$, a graph $G$ is $H$-induced-saturated if $G$ does not contain an induced copy of $H$, but either removing an arbitrary edge from $G$ or adding an arbitrary non-edge to $G$ creates an induced copy of $H$. Depending on the graph $H$, an $H$-induced-saturated graph does not necessarily exist. In fact, (Martin and Smith, 2012) showed that $P_4$-induced-saturated graphs do not exist, where $P_k$ denotes a path on $k$ vertices. Given that it is easy to construct $P_k$-induced-saturated graphs for $k\in \{2,3\}$, (Axenovich and Csikós, 2019) asked whether such graphs exist or not for $k\ge 5$. Recently, Räty (2020) constructed a graph that is $P_6$-induced-saturated. In this paper, we show that there exists a $P_k$-induced-saturated graph for infinitely many values of $k$. To be precise, for each positive integer $n$, we construct infinitely many $P_{3n}$-induced-saturated graphs. Furthermore, we also show that the Kneser graph $K(n,2)$ is $P_6$-induced-saturated for every $n\ge 5$.

对于图 $H$图 $G$ 是 $H$诱导饱和如果$G$ 不包含的归纳副本 $H$，但可以从中删除任意边 $G$ 或将任意非边缘添加到 $G$ 创建的归纳副本 $H$。取决于图$H$， $H$诱导饱和图不一定存在。实际上，（Martin和Smith，2012年）表明$P_4$诱导饱和图不存在 $P_{ķ}$ 表示的路径 $ķ$顶点。鉴于它很容易构造$P_{ķ}$引起的饱和图 $ķ\in \{2，3\}$，（Axenovich andCsikós，2019）询问是否存在这样的图 $ķ\ge 5$。最近，Räty（2020）构造了一个图$P_6$-诱导饱和。在本文中，我们表明存在一个$P_{ķ}$的无穷多个数值的-诱导饱和图 $ķ$。确切地说，对于每个正整数$ñ$，我们构造了无限多个 $P_{3ñ}$诱导的饱和图。此外，我们还显示了Kneser图$ķ（ñ，2）$ 是 $P_6$诱导饱和 $ñ\ge 5$。