x**************.
发帖数: 16 | 1 转信站: mitbbs!jiaoyou8.com!mitbbscn
出 处: mitbbs.cn
发信人: symplectic (愁容/梦里不知身是客), 信区: Mathematics
标 题: A new proof of the 4-colour theorem
发信站: 北大未名站 (2004年09月04日00:18:47 星期六) , 站内信件
Just a moment ago, I found a paper on my colleague's desk,
with the following title:
Every planar graph is 4-colourable and 5-choosable
- a joint proof.
The author is Peter Doerre from Germany. He claimed in
the abstract that:
A new straightforward proof of the 4-colour theorem and the 5-choosable theor
em is present |
|
