Complete graph  

Vertices  n 
Edges  
Radius  
Diameter  
Girth  
Automorphisms  n! (S_{n}) 
Chromatic number  n 
Chromatic index 

Spectrum  
Properties  
Notation  K_{n} 
Table of graphs and parameters 
In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is connected by a pair of unique edges (one in each direction).
Graph theory itself is typically dated as beginning with Leonhard Euler's 1736 work on the Seven Bridges of Königsberg. However, drawings of complete graphs, with their vertices placed on the points of a regular polygon, appeared already in the 13th century, in the work of Ramon Llull.^{[1]} Such a drawing is sometimes referred to as a mystic rose.^{[2]}
The complete graph on vertices is denoted by . Some sources claim that the letter in this notation stands for the German word komplett,^{[3]} but the German name for a complete graph, vollständiger Graph, does not contain the letter , and other sources state that the notation honors the contributions of Kazimierz Kuratowski to graph theory.^{[4]}
has edges (a triangular number), and is a regular graph of degree . All complete graphs are their own maximal cliques. They are maximally connected as the only vertex cut which disconnects the graph is the complete set of vertices. The complement graph of a complete graph is an empty graph.
If the edges of a complete graph are each given an orientation, the resulting directed graph is called a tournament.
can be decomposed into trees such that has vertices.^{[5]} Ringel's conjecture asks if the complete graph can be decomposed into copies of any tree with edges.^{[6]} This is known to be true for sufficiently large .^{[7]}^{[8]}
The number of all distinct paths between a specific pair of vertices in is given^{[9]} by
where refers to Euler's constant, and
The number of matchings of the complete graphs are given by the telephone numbers
These numbers give the largest possible value of the Hosoya index for an vertex graph.^{[10]} The number of perfect matchings of the complete graph (with even) is given by the double factorial .^{[11]}
The crossing numbers up to are known, with requiring either 7233 or 7234 crossings. Further values are collected by the Rectilinear Crossing Number project.^{[12]} Rectilinear Crossing numbers for are
A complete graph with nodes represents the edges of an simplex. Geometrically K_{3} forms the edge set of a triangle, K_{4} a tetrahedron, etc. The Császár polyhedron, a nonconvex polyhedron with the topology of a torus, has the complete graph K_{7} as its skeleton. Every neighborly polytope in four or more dimensions also has a complete skeleton.
K_{1} through K_{4} are all planar graphs. However, every planar drawing of a complete graph with five or more vertices must contain a crossing, and the nonplanar complete graph K_{5} plays a key role in the characterizations of planar graphs: by Kuratowski's theorem, a graph is planar if and only if it contains neither K_{5} nor the complete bipartite graph K_{3,3} as a subdivision, and by Wagner's theorem the same result holds for graph minors in place of subdivisions. As part of the Petersen family, K_{6} plays a similar role as one of the forbidden minors for linkless embedding.^{[14]} In other words, and as Conway and Gordon^{[15]} proved, every embedding of K_{6} into threedimensional space is intrinsically linked, with at least one pair of linked triangles. Conway and Gordon also showed that any threedimensional embedding of K_{7} contains a Hamiltonian cycle that is embedded in space as a nontrivial knot.
Complete graphs on vertices, for between 1 and 12, are shown below along with the numbers of edges:
K_{1}: 0  K_{2}: 1  K_{3}: 3  K_{4}: 6 

K_{5}: 10  K_{6}: 15  K_{7}: 21  K_{8}: 28 
K_{9}: 36  K_{10}: 45  K_{11}: 55  K_{12}: 66 