I got an home work assignment, prove that:
$R(n,n) > (n-1)^2$
Note that I saw on Wikipedia that for subgraph of $K_n$ with k vertices, $R(k,k) > 2^{k/2}$.
I tried to work with that, but still it doesn't really helps me.
I got an home work assignment, prove that:
$R(n,n) > (n-1)^2$
Note that I saw on Wikipedia that for subgraph of $K_n$ with k vertices, $R(k,k) > 2^{k/2}$.
I tried to work with that, but still it doesn't really helps me.
Copyright © 2021 JogjaFile Inc.
The union of $n-1$ copies of $K_{n-1}$ is a graph with $(n-1)^2$ vertices which doesn't contain $K_n$ nor $n$ independent vertices. This proves $R(n,n) > (n-1)^2$ by definition of the Ramsey number.