0 votes 0 votes Show that if $m$ and $n$ are integers with $m \geq 2 \:\text{and}\: n \geq 2,$ then the Ramsey numbers $R(m, n)\:\text{and}\: R(n, m)$ are equal. $\text{(Recall that Ramsey numbers were discussed after Example}\: 13\: \text{in Section}\: 6.2.)$ Combinatory kenneth-rosen discrete-mathematics counting pigeonhole-principle descriptive + – admin asked Apr 29, 2020 edited Apr 29, 2020 by Lakshman Bhaiya admin 224 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.