The Chen-Lawrencenko Conjectures on Cyclic Colorations
Statement
A cyclic coloration of a triangulation of a closed 2-manifold gives the faces around every vertex distinct colors. Chen and Lawrencenko made two conjectures about the cyclic chromatic number of minimal triangulations in 1999. Their second is proved here and their first disproved.
Context
One conjecture each way: the second proved, the first disproved. Two further Chen-Lawrencenko conjectures remain open and are flagged as such in the paper.
Named conjectures standing since 1999 in topological graph theory, with a documented line through Enomoto and Hornak on cyclic colorings; specialist reach.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
"We succeed, based on our extensive interactions with GPT-5.6 Pro, in proving and disproving, respectively, Chen and Lawrencenko's second and first conjectures." The acknowledgement places the model in the exploratory and proof-development stages, with all suggestions substantially revised, corrected and independently verified by the author.
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.