Induced saturation of P₆

Abstract: A graph

G

is called

H

-induced-saturated if

G

does not contain an induced copy of

H

, but removing any edge from

G

creates an induced copy of

H

and adding any edge of

G^{c}

to

G

creates an induced copy of

H

. Martin and Smith showed that there does not exist a

P_{4}

-induced-saturated graph, where

P_{4}

is the path on 4 vertices. Axenovich and Csik'os studied related questions, and asked if there exists a

P_{n}

-induced-saturated graph for any

n g e q 5

. Our aim in this short note is to show that there exists a

P_{6}

-induced-saturated graph.

Recommendations

Cites Work

Cited In (6)

This page was built for publication: Induced saturation of \(P_6\)