Problem 1761 · Hard

Minimum Degree of a Connected Trio in a Graph

Test every triple of nodes that are pairwise adjacent, and score it by the edges that leave the trio.

Open the interactive visualisation