| Dictionary, Encyclopedia and Thesaurus - The Free Dictionary 3,900,176,210 visitors served. |
Dictionary/ thesaurus | Medical dictionary | Legal dictionary | Financial dictionary | Acronyms | Idioms | Encyclopedia | Wikipedia encyclopedia | ? |
Four-Color Problem |
Also found in: Wikipedia | 0.02 sec. |
|
|
four-color problem [¦fȯr ′kəl·ər ‚präb·ləm]
(mathematics) The problem of proving the statement that, given any map in the plane, it is possible to color the regions with four colors so that any two regions with a common boundary have different colors. Four-Color Problem the problem of whether four different colors are sufficient to color any map so that no two regions having a common boundary segment have the same color. Although the conjecture that four colors are enough was proved for all known special cases, the problem long remained unsolved. Not until 1976 was a report of a rigorous mathematical proof published. First formulated as a mathematical problem in the mid-19th century, the four-color problem became widely known through the lectures of the British mathematician A. de Morgan. A rigorous formulation of the problem requires that the regions in question be bounded by Jordan curves—that is, by simple closed curves. It can be easily proved that five colors are always sufficient to color such a map. In the corresponding problem for space, no number of colors is sufficient. REFERENCEAppel, K., and W. Haken. Bulletin of the American Mathematical Society, vol. 82, no. 5, pp. 711–12.Want to thank TFD for its existence? Tell a friend about us, add a link to this page, add the site to iGoogle, or visit the webmaster's page for free fun content. |
|
| Encyclopedia |
| Free Tools: |
For surfers:
Free toolbar & extensions |
Word of the Day |
Help
For webmasters: Free content | Linking | Lookup box | Double-click lookup |
|---|