ProbXiv
Explorersign in
Problem archiveProblem record

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 n⩾4n\geqslant 4. For a finite group G, the enhanced power graph E(G) is the graph with vertex set G and edges {x, y} for all x≠y∈Gx\ne y\in G such that ⟨x,y⟩\langle x,y\rangle is cyclic.

(a) For a given integer n⩾4n\geqslant 4, 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

Added
Links

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.