Skip to main content
OlympiadHQ

Browse · MathNet

Print

62nd Ukrainian National Mathematical Olympiad

Ukraine counting and probability

Problem

Consider a complete graph with 4046 vertices with edges colored in some colors. We call a graph -good graph if all the vertices of the graph can be divided into 2023 pairs in such a way that among the colors of the 2023 of the edges connecting the vertices in the pairs are exactly distinct colors. Is it possible that the graph is 999-good and 1001-good, but not 1000-good?

(Anton Trygub)
Solution
Number the vertices of the graph with numbers from 1 to 4046. Consider the following graph: all edges between vertices of different parity are colored 1 and all other edges are colored in their unique colors. Consider any partition of the vertices into 2023 into pairs. Suppose that in of these pairs the vertices have different parity, and in the same.

Note that is an even number, because even numbers that are not in pairs where the numbers are of different parity must be paired with each other. Thus, is odd, and we have at least one edge of color 1 we have. Thus, the total number of different colors is is an odd number, i.e. we cannot get exactly 1000 colors.
Final answer
Yes

Techniques

Matchings, Marriage Lemma, Tutte's theoremInvariants / monovariantsColoring schemes, extremal arguments