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

2018 Miklós Schweitzer, 1
Let $S\subset \mathbb{R}$ be a closed set and $f:\mathbb{R}^{2n}\to \mathbb{R}$ be a continuous function. Define a graph $G$ as follows: Let $x$ be a vertex of $G$ iff $x\in \mathbb{R}^{n}$ and $f(x,x)\not\in S$, then connect the vertices $x$ and $y$ by an edge in $G$ iff $f(x,y)\in S$ or $f(y,x)\in S$. Show that the chromatic number of $G$ is countable.
countability calculus combinatorics triangle inequality