E******w
发帖数: 2616 | 1 Given any positive real number E, prove that, for all but finitely many
positive integers V, any graph on V vertices with at least (1+E)V edges has
two distinct simple cycles of equal lengths.
(Recall that the notion of a simple cycle does not allow repetition of
vertices in a cycle).
Russia, Pedor
Petrov
好像证明有两个cycle及其简单，证明有两个equal length cycle也还难度不大，但是
还得证明这两个cycle是distinct。乱七八糟这么多条件，让人家在赛场当场证明，这
题出的有点缺德。。。 |
|
