four color theorem
0 sources
Summary
four color theorem is a theorem[1]. It ranks in the top 4% of theorem entities by monthly Wikipedia readership (7,151 views/month).[2]
Key Facts
- Instance of: computer-assisted proof[3], proof by exhaustion[4]
- Part of: list of theorems[5]
- Commons category: Four-color theorem[6]
- Proved by: Kenneth Appel[7], Wolfgang Haken[8]
- Nickname: Guthrie's problem[9]
- Uses: proof assistant[10]
- Statement describes: planar graph[11], graph coloring[12]
- Studied by: graph theory[13]
- On focus list of Wikimedia project: Wikipedia:Vital articles/Level/4[14]
- Maintained by WikiProject: WikiProject Mathematics[15]
Why It Matters
four color theorem has Wikipedia articles in 28 language editions, a strong signal of global cultural recognition.[16] It is known by 93 alternative names across languages and contexts.[17]