perfect graph
Generated by GPT-5-miniExpansion Funnel Raw 70 → Dedup 0 → NER 0 → Enqueued 0
| perfect graph | |
|---|---|
| Name | Perfect graph |
| Field | Graph theory |
| Introduced | 1960s |
| Notable | Claude Berge, László Lovász, Michael Grötschel, Martin Grötschel, Alexander Schrijver, Michel Rao |
perfect graph
A perfect graph is a class of graphs with tight relations between chromatic number and clique number; they were introduced in the work of Claude Berge and connected to major results by László Lovász, Paul Erdős, Richard M. Karp, and Michael R. Garey. The concept influenced research threads involving Cornell University, University of Szeged, University of Waterloo, Bell Labs, and IBM Research and appears in landmark conferences such as the International Congress of Mathematicians and the ACM Symposium on Theory of Computing. The study of perfect graphs touches combinatorics, optimization, and theoretical computer science through links to the Erdős–Rényi model, Polish Academy of Sciences, Royal Society, and awards like the Fulkerson Prize.
Definition and basic properties
A finite simple graph G is perfect when for every induced subgraph H the chromatic number equals the size of a largest clique; this notion was central in papers by Claude Berge and formalized in research at Mathematical Reviews, Annals of Mathematics, and by authors affiliated with Princeton University and University of Cambridge. Fundamental properties were proved by László Lovász who used semidefinite programming techniques connected to work at Bell Labs and collaborations with researchers from Microsoft Research. Early structural observations relate perfect graphs to complement graphs, induced subgraphs, and dualities that appear in texts from Cambridge University Press, Springer, and proceedings of SIAM conferences. Key lemmas use results from Paul Erdős and build on methods developed at Institute for Advanced Study and Clay Mathematics Institute seminars.
Examples and non-examples
Classic examples include bipartite graphs studied by researchers at University of Washington and Stanford University, chordal graphs analyzed at Tel Aviv University and Hebrew University of Jerusalem, and comparability graphs linked to work at Massachusetts Institute of Technology. Non-examples historically motivated conjectures: odd cycles of length at least five and their complements appear in constructions used by Paul Erdős and Jaroslav Nešetřil; such graphs were pivotal in counterexamples discussed at European Congress of Mathematics meetings. Specific graph families investigated in texts from Oxford University Press include split graphs, interval graphs, and circular-arc graphs; researchers from Yale University and Columbia University contributed classification results distinguishing these classes from perfect graphs.
Perfect graph theorem and related results
The Perfect Graph Theorem, proved by László Lovász, states that the complement of a perfect graph is perfect; this theorem followed conjectures of Claude Berge and inspired later proofs by groups at ETH Zurich and Université Paris-Sud. The Strong Perfect Graph Theorem, established by a large collaborative effort including Neil Robertson, Paul Seymour, Robin Thomas, and Seymour's group, characterized perfect graphs via forbidden induced subgraphs and generated follow-up work at University of Waterloo, Rutgers University, and California Institute of Technology. Subsequent refinements involved algorithms and polyhedral results by teams at IBM Research and INRIA and were presented at International Symposium on Mathematical Programming and Foundations of Computer Science workshops.
Characterizations and forbidden subgraphs
Characterizations hinge on forbidden induced structures such as odd holes and odd antiholes; these obstacles were cataloged in papers by researchers at University of Illinois Urbana-Champaign and Georgia Institute of Technology. Structural decompositions employ modules, 2-joins, and skew partitions studied by scholars affiliated with University of Toronto and University of British Columbia. Forbidden-subgraph theory in this realm connects to classical work by W. T. Tutte and extensions appearing in monographs from Springer-Verlag and courses at Princeton. Decomposition theorems used in proofs draw on techniques developed at McGill University, Carnegie Mellon University, and University of Paris.
Algorithmic aspects and complexity
Algorithmic results include polynomial-time recognition algorithms developed by collaborators at Bell Labs and Microsoft Research and optimization methods leveraging semidefinite programming from AT&T Bell Laboratories and IBM Research. Coloring, clique, and stable set problems restricted to perfect graphs admit algorithms rooted in interior-point methods used by teams at ETH Zurich and INRIA; complexity classifications reference foundational work by Richard M. Karp and Stephen Cook and later refinements at Harvard University and Columbia University. Practical implementations and heuristics were reported in proceedings of the ACM SIGGRAPH and SIAM conferences and by projects at Google Research and Facebook AI Research.
Applications and connections to other areas
Perfect graphs interface with combinatorial optimization topics like maximum clique and graph coloring problems studied at Cornell University and applied in scheduling and frequency assignment projects at Bell Labs and Nokia. Connections extend to polyhedral combinatorics investigated at The Institute for Operations Research and the Management Sciences and to integer programming research at IBM Research and INRIA. Cross-disciplinary links include coding theory explored at Dolores Research Institute and network design problems addressed in collaborations with AT&T and Siemens; further interactions appear in statistical physics seminars at Los Alamos National Laboratory and complexity workshops at Microsoft Research.