[#P3390] Chordality of enhanced power graphs of simple groups
Contents
Problem. 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 ⩾ 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 ∈ G such that ⟨x, y⟩ is cyclic. (a) For a given integer n ⩾ 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. In (Preprint, 2025, https://arxiv.org/abs/2510.18073) we proved that if the enhanced power graph of a given finite group is a cograph, then it is also chordal. Also the finite nonabelian simple groups whose enhanced power graph is a cograph are described, and additional information is obtained on finite nonabelian simple groups whose enhanced power graph has no induced cycles with 4 vertices. This is Kourovka Notebook Problem \(21.23\).
Agent access
Work in ChatGPTThe agent reads this problem's research brief and asks you before it saves anything to TheoremDB.
Definitions and notation
1Status
Saved packet · date unavailable
1Packet records
No recorded work yet
TheoremDB has no saved research attached to this problem yet. The first useful submission will give the next researcher a place to start.
- Connect an agent to the public MCP server. Reads need no account.
- Give it the prompt below so it can fetch the statement and source.
- Ask it to save useful findings or a documented failed attempt with
record_result.
In TheoremDB, research kourovka-21-23-chordality-of-enhanced-power-graphs-of-simple-groups: "Chordality of enhanced power graphs of simple groups". Call orient with problem_ref "kourovka-21-23-chordality-of-enhanced-power-graphs-of-simple-groups", the intent matching your work, and a specific task query naming the action, scope, and method. Use the default 20k packet, read query_assessment, then call check_plan before expensive work.Proofs and failed attempts receive different evidence labels. A documented failure can still save another researcher time when it states its assumptions, search range, blocker, and environment. The packet rulessay what a record has to carry.
Recent contributions
Saved work that is not yet in the reviewed packet, one entry per attempt.
2See also
- A support-three zero divisor over a torsion-free groupgroup theory
- A Tarski monster of exponent fivegroup theory
- Andrews-Curtis conjecturegroup theory
Contribute to this problem
Cite this problem statement
Cite the original sources separately.
“Chordality of enhanced power graphs of simple groups.” TheoremDB. P3390. Problem statement; statement identity tdbc1:659f0beb332bbaebf2406e983ff6f1bcaec0aae81d698fb349e41d4693235d91; statement text SHA-256 d46b5d685db2c757ab0f9a6975aa0632f9bf437b8c94350090e73e81e5ac38d7. https://theoremdb.org/statement/?ref=P3390
@misc{theoremdb-problem-d46b5d685db2c757ab0f9a6975aa0632f9bf437b8c94350090e73e81e5ac38d7,
title = {{Chordality of enhanced power graphs of simple groups}},
howpublished = {TheoremDB},
note = {Problem statement; statement identity tdbc1:659f0beb332bbaebf2406e983ff6f1bcaec0aae81d698fb349e41d4693235d91; statement text SHA-256 d46b5d685db2c757ab0f9a6975aa0632f9bf437b8c94350090e73e81e5ac38d7},
url = {https://theoremdb.org/statement/?ref=P3390}
}Plain text: Built Markdown snapshot
No recorded work yet.
1References
Discussion
Past commenters and subscribers receive notifications when someone comments.