Simple Graph is not Simple
Source: 2019 Taiwan TST Round 3
April 2, 2020
combinatorics
Problem Statement
Given a simple graph with vertices. Assume we arbitrarily choose vertices as a group (the other is another group, of course), there are always edges that connect two groups. Find all possible value of .