Kempe state-reducibility conjecture for small configurations
Statement
A configuration is a local planar-map configuration, and a configuration is Kempe state-reducible when every -face coloring on a state graph of its reducer is state-extendible to a -face coloring on some state graph of the original, either directly or after a succession of Kempe switches on colorings on state-graph surfaces.
Kempe state-reducibility conjecture. At least one of the following configurations is Kempe state-reducible: a single pentagon, a single hexagon, two adjacent pentagons, or three pairwise-adjacent pentagons.
State-reducibility provides an alternative to ordinary reducibility because it does not rely on Kempe switches; the conjecture proposes that adding Kempe switches may make the method applicable to smaller configurations. Its resolution is not given in the paper.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.