Kourovka Notebook Problem 21.23
Statement
A graph is called a cograph if it has no induced subgraph isomorphic to a path with 4 vertices. A graph is said to be chordal if it has no induced cycles with n vertices for every . For a finite group G, the enhanced power graph E(G) is the graph with vertex set G and edges {x, y} for all such that is cyclic.
(a) For a given integer , determine the set of all finite nonabelian simple groups G such that E(G) has no induced cycles with n vertices.
(b) Determine the set of all finite nonabelian simple groups G such that E(G) is chordal.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.