On two conjectures on triangulations of 2-manifolds
arXiv:2608.06863
Abstract
For a closed, connected 2-manifold , and for a triangulation of , we write in place of the vertex set associated with . A cyclic coloration of a triangulation of refers to a face coloring of such that: For each , the faces incident to have distinct colors. Chen and Lawrencenko [Yokohama Math. J., 1999] conjectured that there exists a constant (depending only on ) such that colors suffice for there to exist a cyclic coloration of a triangulation of . We prove this conjecture, using a greedy algorithm related to the Euler-Poincaré formula for surface triangulations. Chen and Lawrencenko also conjectured that: If is not the projective plane and is a triangulation of that is minimal with respect to the number of vertices, then , where denotes the minimum possible number of vertices among all triangulations of the 2-manifold , and where denotes the minimal value such that admits a cyclic coloration with colors. We disprove this latter conjecture via an explicit counterexample, using an 8-vertex triangulation of the Klein bottle with 16 faces. It appears that both of the Chen-Lawrencenko conjectures have remained open, prior to our work.
Submitted for publication