Graph Theorymedium
0:00.0

What is the diameter of a complete graph KnK_n for n2n \geq 2? (Diameter is the longest shortest path between any two vertices.)