| File information | File size | Options |
Original JPG File1755 × 1755 pixels (3.08 MP) 14.9 cm × 14.9 cm @ 300 PPI | 65 KB | Download |
Screen800 × 800 pixels (0.64 MP) 6.8 cm × 6.8 cm @ 300 PPI | 37 KB | Download |
PreviewScreen Preview | 37 KB | View |
585
Open
Frederik Wellmann
A. MS.
MATHEMATICS (MS 1-278)
The problem of map-coloring is stated as follows: "To determine demonstratively the smallest number of colors that will suffice so as to color any map whatever which can be drawn on a given surface, that no two confine regions (that is, two regions having a common boundary-line) shall have the same color." See CSP W. E. Story correspondence, 12/29/00.
graphics, topical (topics or topology), fourcolor problem (Map), Mathematics
pp. 1-10, plus variants and many other attempts (82 pp. in all), none going beyond p. 10
1899/1900
154
n.p.
MATHEMATICS / TOPICAL GEOMETRY
yes
