Talk:Complete graph

From Wikipedia, the free encyclopedia

[edit] Enneagon and Decagon

This article has pictures of all regular polygons from a triangle to an octagon. The triangle has nothing but its sides and corners, but the octagon looks very complicated. Can anyone see how complicated an enneagon or decagon will look?? 66.245.86.215 01:21, 16 Oct 2004 (UTC)

You mean K₉ and K₁₀? As a general rule, the complete graph on n vertices, K_n, has n × (n - 1) / 2 edges; so K₉ has 9 × (9 - 1) / 2 = 36 edges, and K₁₀ has 10 × (10 - 1) / 2 = 45. So yeah, they can look quite complicated!  :-) I guess since we've already got K₁ to K₈, we might as well add 9 and 10; or we could add K₁₀₀ just to illustrate how messy they can get... --Ejrh 02:22, 18 Oct 2004 (UTC)

K100 added! It's really beautiful. Alpt 18:41, 30 October 2006 (UTC)