Talk:Scheinerman's conjecture
Latest comment: 16 years ago by David Eppstein in topic Mistake?
 | This article is rated Start-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||
| |||||||||||
Mistake? edit
The article states:
If a graph is represented with segments having only k directions, then the graph can be colored using k colors, one color for each direction, so West's version of the conjecture implies the four color theorem.
How could this be right? Is there a hidden assumption that no two line segments are subsets of the same line? Think about the counterexample of 4 segments that are all subsets of the same line and their mutual intersection is nonempty. Oded (talk) 02:58, 2 April 2008 (UTC)
- Thanks for clearing this up. —David Eppstein (talk) 16:55, 4 April 2008 (UTC)