Math-1202 · mathematics · Group theory

Math-1202

Kourovka Notebook Problem 21.23

Status Open · unsolvedmath.comLLM status Open unverified

Top Open Problems Not reported cataloguedOpenOpen

Statement

Definitions and mathematical statement

For a finite group $G$, its enhanced power graph $E(G)$ is the finite simple undirected graph whose vertices are the elements of $G$. Distinct elements $x,y$ are adjacent exactly when the subgroup $\langle x,y\rangle$ is cyclic, meaning generated by a single element. The identity is included as a vertex. This adjacency condition is not merely the condition that one of $x,y$ is a power of the other.

An induced cycle of length $n\ge4$ is a sequence of distinct vertices $x_1,\ldots,x_n$ such that adjacent vertices in cyclic order are joined, and no other pairs among these vertices are joined. In this graph, consecutive pairs must generate cyclic groups while all nonconsecutive pairs must generate noncyclic groups. A graph is chordal if it has no induced cycle of any length at least four.

Part (a) asks, for each fixed integer $n\ge4$, for the complete set of finite nonabelian simple groups $G$ for which $E(G)$ has no induced $n$-cycle. Here simple means that $1$ and $G$ are its only normal subgroups. Part (b) asks for the complete set of such groups for which $E(G)$ is chordal.

A classification must give necessary and sufficient conditions, up to group isomorphism. For part (a), excluding one specified length does not exclude the others; part (b) imposes their simultaneous exclusion. The auxiliary cograph notion in the source means absence of an induced four-vertex path, a distinct restriction rather than either requested classification.

Short English statement

Classify finite nonabelian simple groups whose enhanced power graphs avoid an induced cycle of a specified length, and those whose graphs are chordal.

Sources

Catalogue entry

Statement licence: CC-BY-4.0 · Source file

Contributions 0

No attempts yet. Significant partial results and substantial reductions are welcome. Contribute an attempt.