Nordic 2016 P4
Source:
April 4, 2017
combinatoricsgraph theory
Problem Statement
King George has decided to connect the islands in his kingdom by bridges. Unfortunately the rebel movement will destroy two bridges after all the bridges have been built, but not two bridges from the same island. What is the minimal number of bridges the King has to build in order to make sure that it is still possible to travel by bridges between any two of the islands after the rebel movement has destroyed two bridges?