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.
| Moon–Moser theorem | |
|---|---|
| Name | Moon–Moser theorem |
| Field | Graph theory, Combinatorics |
| Theorem | Moon–Moser theorem |
| Authors | Jacob Moon, Leo Moser |
| Year | 1965 |
| Area | Ramsey theory, Extremal graph theory |
Moon–Moser theorem
The Moon–Moser theorem is a result in Graph theory and Combinatorics that gives an exact maximum count of maximal cliques in an n-vertex simple undirected graph. It identifies extremal constructions attaining that maximum and connects to problems in Ramsey theory, Turán's theorem, and enumeration in Extremal graph theory. The theorem influenced subsequent work by researchers at institutions such as Princeton University, University of Toronto, and University of Cambridge and remains a touchstone in studies by mathematicians including Paul Erdős, Alfréd Rényi, and Béla Bollobás.
The Moon–Moser theorem states that for every integer n ≥ 1 an n-vertex simple undirected graph has at most 3^{n/3} maximal cliques, with equality achieved by the disjoint union of ⌊n/3⌋ copies of the complete graph K_3 together with K_1 or K_2 as needed. This exact bound refines earlier asymptotic and extremal bounds found in work connected to Turán's theorem and complements results from Mantel's theorem and studies by Paul Erdős and Alfréd Rényi. The theorem explicitly identifies the extremal family—graphs formed by partitioning vertices into triangles and possibly a leftover edge or vertex—thus tying the combinatorial extremum to concrete constructions known in Extremal graph theory.
Moon and Moser published the theorem in 1965 amid a surge of interest in enumerative and extremal combinatorics influenced by the work of Paul Erdős, Alfréd Rényi, and contemporaries at places like Bell Labs and Institute for Advanced Study. Motivations included problems in Ramsey theory about unavoidable substructures, questions raised by Turán on maximizing edges without forcing cliques, and algorithmic concerns stemming from research at Bell Labs and universities on enumerating maximal cliques for applications in pattern detection and social network analysis. The exact counting problem contrasted with probabilistic methods championed by Erdős and deterministic constructive approaches used by authors such as Béla Bollobás and Pál Erdős. The result found resonance with later computational complexity inquiries by researchers affiliated with MIT and Stanford University into the worst-case enumeration complexity of maximal cliques.
The original proof uses combinatorial extremal techniques, induction on n, and careful structural analysis of how maximal cliques intersect. Moon and Moser analyze vertex neighborhoods and apply case distinctions reminiscent of methods in proofs of Turán's theorem and arguments employed by Paul Erdős in extremal problems. Key steps include bounding the number of maximal cliques containing a given vertex, reducing to smaller graphs obtained by deleting vertices, and showing that the triangle-partition construction cannot be beaten. The proof leverages counting arguments related to those used in results by Frank Ramsey and structural lemmas that echo ideas in works by Erdős–Rényi and Béla Bollobás. Later alternative proofs used convexity arguments, linear algebraic methods seen in research at Harvard University and combinatorial optimization insights developed by scholars at Bell Labs and Carnegie Mellon University.
The Moon–Moser bound has direct implications for the worst-case complexity of algorithms that list all maximal cliques, a topic of interest to researchers at IBM and in algorithmic graph theory groups at Stanford University and UC Berkeley. It provides a tight worst-case enumeration bound for algorithms such as the Bron–Kerbosch algorithm studied by authors at Bell Labs and fosters lower-bound constructions used in complexity separations investigated by scholars affiliated with MIT and Princeton University. The extremal family also appears in investigations into induced subgraph counts pursued by Paul Erdős and in structural graph theory questions treated at Cambridge University and Oxford University. In addition, the theorem informs applied domains where maximal cliques model cohesive groups, echoing interdisciplinary work connecting mathematics departments at University of Chicago with studies in social science institutions like RAND Corporation and computational biology groups at Salk Institute.
Several generalizations extend the Moon–Moser perspective. One line of work changes the underlying forbidden structure, linking to variants of Turán's theorem and to extremal questions addressed by Erdős–Stone theorem and researchers at Columbia University. Other results tighten bounds for graphs with additional constraints, such as bounded degree or planarity, drawing on techniques developed by scholars at ETH Zurich and INRIA. Connections exist to enumeration of maximal independent sets (via complement graphs), relating to classical theorems by Merrifield–Simmons and later expansions by researchers at University of Waterloo and University of British Columbia. Further related results include bounds on maximal bicliques studied by groups at Microsoft Research and refinements for hypergraphs and simplicial complexes investigated by teams at University of California, San Diego and University of Toronto. The theorem continues to inspire extremal and algorithmic research in combinatorics by mathematicians affiliated with institutions such as Princeton University, University of Cambridge, Harvard University, and Stanford University.
Category:Theorems in graph theory