Loterre: Matemáticas: four color theorem

graph theory > four color theorem

four color theorem

In mathematics, the four color theorem, or the four color map theorem, states that no more than four colors are required to color the regions of any map so that no two adjacent regions have the same color. Adjacent means that two regions share a common boundary curve segment, not merely a corner where three or more regions meet. It was the first major theorem to be proved using a computer. Initially, this proof was not accepted by all mathematicians because the computer-assisted proof was infeasible for a human to check by hand. The proof has gained wide acceptance since then, although some doubters remain.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Four_color_theorem)

http://data.loterre.fr/ark:/67375/PSR-NQXK668T-X

RDF/XML TURTLE JSON-LD última modificación 12/10/23

LOTERRE