Kourovka Problem 21.24 - Cograph Power Graphs Are Chordal
If the power graph of a finite group contains no induced path on four vertices, must it also contain no induced cycle of length at least four - that is, is every cograph power graph chordal?
- Result
- Proved
- Status
- Resolved
- AI contribution
- AI-discovered
- Method
- Argument
- Field
- Group theory
- Posed by
- —
- Year posed
- 2026
- Years open
- 0y
- Solved
- 2026-07-20
- Model
- Aristotle
- Vendor
- Harmonic
- Collaborators
- —
- Verification
- Lean-verified
- Publication
- Preprint
- Significance
- 15 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What the AI did
The solution was discovered autonomously by Aristotle and formalized in Lean; the human authors curated the exposition.
Verification
Autonomously discovered and formally verified in Lean by Aristotle; author-curated arXiv preprint covering eight Kourovka Notebook problems.
Source
arXiv:2607.17477 - On some problems from the Kourovka Notebook