Abstract
AbstractFor a plane near‐triangulation with the outer face bounded by a cycle , let denote the function that to each 4‐coloring of assigns the number of ways extends to a 4‐coloring of . The Block‐count reducibility argument (which has been developed in connection with attempted proofs of the Four Color Theorem) is equivalent to the statement that the function belongs to a certain cone in the space of all functions from 4‐colorings of to real numbers. We investigate the properties of this cone for , formulate a conjecture strengthening the Four Color Theorem, and present evidence supporting this conjecture.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
