This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| complete graph | |
|---|---|
| Name | Complete graph |
| Edges | n(n-1)/2 |
| Connectivity | n-1 |
complete graph A complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. Introduced in early graph theory by contributors associated with Leonhard Euler, Arthur Cayley, and later formalized in texts by Dénes Kőnig and Paul Erdős, the concept is central to combinatorics, network theory, and extremal problems studied by Pál Erdős and Alfréd Rényi. Complete graphs serve as extremal examples in theorems by Turán, Mantel, and in algorithmic contexts illuminated by researchers at institutions such as Bell Labs and MIT.
A complete graph on n labeled vertices, often denoted K_n in classical literature by William Rowan Hamilton-era notation and popularized in monographs by Frank Harary, contains exactly one edge between every unordered pair of distinct vertices. In the setting of graph theory developed by Gustav Kirchhoff and formalized by scholars at Cambridge University and Princeton University, K_n is simple (no loops, no multiple edges), undirected, and finite, forming the prototype for saturated graphs used in proofs by Paul Turán and Erdős–Rényi probabilistic models.
K_n is maximally connected: its vertex-connectivity and edge-connectivity equal n−1, a fact leveraged in network resilience analyses by researchers at Stanford University and Carnegie Mellon University. Its degree sequence is regular of degree n−1, a property referenced in lectures by Richard Guy and textbooks by Douglas West. The complete graph is Hamiltonian for n≥3, a concept linking back to William Rowan Hamilton and problems studied at Trinity College Dublin. K_n is also vertex-transitive and edge-transitive, symmetries tied to the action of the symmetric group studied by Évariste Galois and explored in algebraic graph theory by Chris Godsil.
Common small instances include K_1 (a single vertex), K_2 (a single edge), K_3 (a triangle, central to work by Leonhard Euler on planar partitions), and K_5 (notably nonplanar in Kuratowski’s theorem discussed by Kazimierz Kuratowski and Kuratowski-related proofs by Paul Halmos). Notation K_n appears in seminal texts by Claude Berge and in the catalogue of graphs compiled by researchers at Oxford University and Cambridge University. The complement of K_n is the empty graph, a duality used in extremal results by Turán and in Ramsey-theoretic investigations by Frank P. Ramsey.
Edge count of K_n is given by n(n−1)/2, a triangular-number identity earlier studied by Johann Carl Friedrich Gauss and applied by Srinivasa Ramanujan-era techniques in enumerative combinatorics. The number of distinct labeled spanning trees equals n^{n−2} by Cayley’s formula, proved by Arthur Cayley and later generalized by researchers at Institut Mittag-Leffler. Chromatic number equals n, with chromatic polynomial P(K_n, x)=x(x−1)...(x−n+1), results appearing in works by Philip Hall and in algebraic combinatorics treatments by Richard P. Stanley. Eigenvalues of the adjacency matrix are n−1 (multiplicity 1) and −1 (multiplicity n−1), spectral facts used in expander and spectral graph theory studies by Alon and Boppana.
K_5 and K_3,3 are classical nonplanar obstructions in planar graph theory proved by Kazimierz Kuratowski and furthered by planar-graph investigations at Bell Labs and IBM Research. Geometric drawings of K_n into the plane with straight-line edges relate to crossing number problems studied by Guy, with exact crossing numbers known for small n and asymptotics established by work connected to Ajtai and Leighton. Embeddings on surfaces are classified via genus formulas: orientable genus of K_n equals ceil((n−3)(n−4)/12), a result appearing in topology and combinatorial map literature associated with Heawood and advanced at institutions like Princeton University.
Complete graphs model all-to-all communication networks in distributed computing architectures studied at MIT and Bell Labs, appear as worst-case instances in routing problems addressed at AT&T and in scheduling problems treated by researchers at IBM and Microsoft Research. They serve as base cases in Ramsey theory problems initiated by Frank P. Ramsey and extended by Paul Erdős and Ronald Graham. In chemistry, the tetrahedral K_4 corresponds to molecular models considered in studies by IUPAC communities. In social network analysis, cliques (complete subgraphs) are central to community detection algorithms developed by teams at Stanford University and Facebook.
Variants include complete multipartite graphs studied by Paul Turán (Turán graphs), complements related to empty graphs, and directed analogs (tournaments) analyzed by Reid Barton-style results and by researchers at Cambridge University in orientations theory. Weighted complete graphs underpin metric spaces used in traveling salesman problem instances explored at Bell Labs and INRIA. Random graph models such as Erdős–Rényi G(n,p) interpolate between empty and complete graphs in probabilistic combinatorics developed by Alfréd Rényi and Paul Erdős.