Kourovka Problem 21.24: Finite-group cograph power graphs are chordal
- Mathematics
Every power graph of a finite group that is a cograph is chordal; equivalently, an induced four-cycle forces an induced four-vertex path.
Kourovka Problem 21.24: Finite-group cograph power graphs are chordal
- Mathematics
Every power graph of a finite group that is a cograph is chordal; equivalently, an induced four-cycle forces an induced four-vertex path.
Curated contributions 1
Understand the problem ↓Understanding the problem
Read the background
Every power graph of a finite group that is a cograph is chordal; equivalently, an induced four-cycle forces an induced four-vertex path.
Why it matters
The proof settles the finite-group power-graph implication.
What counts as progress
A specific group theory result with documented AI mathematical work, a stated prior baseline and a checkable source.
Website timeline
Publication dates and editorial changes.
Kourovka Problem 21.24: Finite-group cograph power graphs are chordal