Affordable Access

Publisher Website

Some arithmetical restatements of the Four Color Conjecture

Authors
Journal
Theoretical Computer Science
0304-3975
Publisher
Elsevier
Publication Date
Volume
257
Identifiers
DOI: 10.1016/s0304-3975(00)00115-8
Keywords
  • Planar Graphs
  • Four Colours
  • Binomial Summation

Abstract

Abstract The Four Colour Conjecture is reformulated as a statement about non-divisibility of certain binomial coefficients. This reformulation opens a (hypothetical) way of proving the Four Colour Theorem by taking advantage of recent progress in finding closed forms for binomial summations.

There are no comments yet on this publication. Be the first to share your thoughts.