|
|
|
|
|
by Syzygies
402 days ago
|
|
Yes. The article ran through this point as follows: "In 1964, a mathematician named Vadim Vizing proved a shocking result: No matter how large a graph is, it’s easy to figure out how many colors you’ll need to color it. Simply look for the maximum number of lines (or edges) connected to a single point (or vertex), and add 1." I keep wondering why I ever read Quanta Magazine. It takes a pretty generous reading of "need" to make this a correct statement. |
|
If you read the introduction, you'll also read that the goal is to "color each of your lines and require that for every point, no two lines connected to it have the same color."
Ps. "How many colors a graph needs" is a very well established term in computer science and graph theory.