Winner complexity of Node Kayles on subcubic trees
TheoremDB P2930 · combinatorial games
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Given a finite tree of maximum degree at most three as a Node Kayles position, what is the complexity of deciding whether the next player has a winning strategy? In particular, is the problem polynomial-time solvable or PSPACE-complete?
Lean 4
No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.
Background
Additional formulation recorded by the source
Classify the language .
Progress & source assessment
Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution.
- [1]TheoremDB P2930 link
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.