We Solve Problems
Problems
Categories
F.A.Q.
Sign In
Sign Up
Sign Up
Problem
#WSP-000488
Problems
Graph theory
12–16
3.0
Problem
By considering
k
−
1
copies of
K
k
−
1
, show that
R
(
k
,
k
)
≥
(
k
−
1
)
2
.
To see the solution
register
and get verified.