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: 801

Russian TST 2021, P3
Tags: combinatorics , graph theory
Given a natural number $n\geqslant 2$, find the smallest possible number of edges in a graph that has the following property: for any coloring of the vertices of the graph in $n{}$ colors, there is a vertex that has at least two neighbors of the same color as itself.