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

2023 Bangladesh Mathematical Olympiad, P8
Tags: graph theory , combinatorics , induction
We are given $n$ intervals $[l_1,r_1],[l_2,r_2],[l_3,r_3],\dots, [l_n,r_n]$ in the number line. We can divide the intervals into two sets such that no two intervals in the same set have overlaps. Prove that there are at most $n-1$ pairs of overlapping intervals.