Supposedly Vizing had some difficulty publishing what is now known as Vizing's theorem (the result that every degree-d graph can be edge-colored with at most d+1 colors) leading to it eventually being published in a very obscure journal, Akademiya Nauk SSSR. Sibirskoe Otdelenie. Institut Matematiki. Diskretny˘ı Analiz. Sbornik Trudov. Soifer recounts the story in The Mathematical Coloring Book, pages 136–137.
|
2 | added link | ||
|
|
||||
|
|
1 | [made Community Wiki] | ||
|
Supposedly Vizing had some difficulty publishing what is now known as Vizing's theorem (the result that every degree-d graph can be edge-colored with at most d+1 colors) leading to it eventually being published in a very obscure journal, Akademiya Nauk SSSR. Sibirskoe Otdelenie. Institut Matematiki. Diskretny˘ı Analiz. Sbornik Trudov. Soifer recounts the story in The Mathematical Coloring Book, pages 136–137. |
||||
