Neuen-Grohe Problem: Isomorphism of Tournaments with Bounded VC Dimension
Among classes of tournaments for which neither hardness nor polynomial-time solvability of isomorphism was known, bounded VC dimension stood out as an open problem of Neuen and Grohe. Resolved: isomorphism of tournaments of VC dimension $d$ is decidable in time $n^{O(d \log d)}$, so automorphism groups of bounded-VC tournaments are computable in polynomial time; isomorphism of tournaments of bounded chromatic number is also polynomial-time decidable.
Exact FrontierDelta
Scope and record
Occurred: Aug 14, 2026
Delta type: SOURCE CLAIM
Assumptions: VibeMathed verification: unreviewed. Publication: preprint. AI contribution: ai-co-developed. Imported under CC BY 4.0.
Canonical aliases: Neuen-Grohe Problem: Isomorphism of Tournaments with Bounded VC Dimension · Tournament isomorphism, bounded VC
Confidence: Not scored
Registry verification: unreviewed · preprint · resolved
Attribution
VibeMathed
registry · event recorded by
Simon Rassmann
human · human collaborator
Pascal Schweitzer
human · human collaborator
Claude Sonnet 5
model · ai model contributor · Anthropic
Lineage and corrections
This event attributed to Pascal Schweitzer
This event attributed to Simon Rassmann
This event attributed to Claude Sonnet 5