We formulate a conjecture from graph theory that is equivalent to Nash-solvability of the finite two-person shortest path games with positive local costs. For the three-person games such conjecture fails.

翻译：我们从图表理论中得出一个假设,这个假设相当于有限的双人最短路径游戏的Nash可溶性,当地成本为正数。 对于三人游戏来说,这样的推测失败了。