Problem #WSP-000155

Problems Graph theory

Problem

In Rabbitland you can get from any city to any other city. Bugs Bunny decided to find out what is the largest number of cities he can visit, while never visiting any city twice. He can start from any city and finish at any other. He realised that there are two longest paths he can take and they both involve the same number of cities. Show that those two paths have at least one city in common.