So let's assume that $s \leq t$, and we use the following definition: the Ramsey number $R(s, t)$ is the smallest value of $N$ such that under every red-blue coloring of $K_{N}$, there is a red $K_s$ or a blue $K_t$.
All graph theory books and lecture notes I can find say that "it is obvious that $R(s, t) = R(t, s)$", but unfortunately I can't see this.
So let's say $R(s, t) = N$, and under a certain red-blue coloring of $K_N$, we have a blue $K_t$, then clearly we have a red $K_s$ since $s \leq t$. However, if we have another red-blue coloring of $K_N$ that only yields a red $K_s$ but no blue $K_t$, then how can we assure that we can certainly obtain a red $K_t$ or a blue $K_s$?
I appreciate any help.
Fix a red-blue colouring of $K_N$ and construct a new colouring by exchanging the colour red with the colour blue. This new colouring either contains a red $K_s$ or a blue $K_t$ by definition of $N$. Hence the original colouring contains a red $K_t$ or a blue $K_s$ as required.