Generalized Petersen graph induced-subgraph conjecture

A generalized Petersen graph is a graph of the form $G(n,k)$, consisting of an outer $n$-cycle, an inner set of vertices joined according to multiplication by $k$ modulo $n$, and corresponding outer-inner edges. A graph is an induced subgraph of another graph if its vertices induce exactly the edges of the smaller graph. A minimal Cayley graph is a Cayley graph whose connection set is a minimal generating set for its group.

Generalized Petersen graph conjecture. Every generalized Petersen graph is an induced subgraph of a minimal Cayley graph.

The paper notes that some generalized Petersen graphs are already covered by known characterizations of generalized Petersen graphs that are themselves minimal Cayley graphs, and gives a general induced-subgraph construction for certain parameters together with computational checks for small cases. The assertion is posed as a principal open question.