This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 1

2016 Belarus Team Selection Test, 2
Tags: combinatorics , graph theory , domination numbers
Given a graph with $n \geq 4$ vertices. It is known that for any two of vertices there is a vertex connected with none of these two vertices. Find the greatest possible number of the edges in the graph.