Kourovka Notebook Problem 21.24
Statement
For a finite group G, the power graph P(G) is the graph with vertex set G and edges {x, y} for all such that either or . Is it true that, for every finite group G, if P(G) is a cograph, then P(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.