Problem

Source: 2023 Serbia TST Problem 1

Tags: Extremal Graph Theory, ad hoc, Serbia, TST, graph theory, combinatorics



In a simple graph with 300 vertices no two vertices of the same degree are adjacent (boo hoo hoo). What is the maximal possible number of edges in such a graph?