Editing Clique (graph theory)

{{Short description|Adjacent subset of an undirected graph}}
{{Other uses|Clique (disambiguation)}}
[[File:VR complex.svg|thumb|upright=1.35|A graph with {{unordered list
| 23 × 1-vertex cliques (the vertices),
| 42 × 2-vertex cliques (the edges),
| 19 × 3-vertex cliques (light and dark blue triangles), and
| 2 × 4-vertex cliques (dark blue areas).}}
The 11 light blue triangles form maximal cliques. The two dark blue 4-cliques are both maximum and maximal, and the clique number of the graph is 4.]]

In [[graph theory]], a '''clique''' ({{IPAc-en|ˈ|k|l|iː|k}} or {{IPAc-en|ˈ|k|l|ɪ|k}}) is a subset of vertices of an [[undirected graph]] such that every two distinct vertices in the clique are [[Adjacent (graph theory)|adjacent]]. That is, a clique of a graph <math>G</math> is an [[induced subgraph]] of <math>G</math> that is [[complete graph|complete]]. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and constructions on graphs. Cliques have also been studied in [[computer science]]: the task of finding whether there is a clique of a given size in a [[Graph (discrete mathematics)|graph]] (the [[clique problem]]) is [[NP-complete]], but despite this hardness result, many algorithms for finding cliques have been studied.

Although the study of [[complete graph|complete subgraphs]] goes back at least to the graph-theoretic reformulation of [[Ramsey theory]] by {{harvtxt|Erdős|Szekeres|1935}},<ref>The earlier work by {{harvtxt|Kuratowski|1930}} characterizing [[planar graph]]s by forbidden complete and [[complete bipartite graph|complete bipartite]] subgraphs was originally phrased in topological rather than graph-theoretic terms.</ref> the term ''clique'' comes from {{harvtxt|Luce|Perry|1949}}, who used complete subgraphs in [[social network]]s to model [[clique]]s of people; that is, groups of people all of whom know each other. Cliques have many other applications in the sciences and particularly in [[bioinformatics]].

==Definitions==
A '''clique''', {{mvar|C}}, in an [[undirected graph]] {{math|1=''G'' = (''V'', ''E'')}} is a subset of the [[Vertex (graph theory)|vertices]], {{math|''C'' ⊆ ''V''}}, such that every two distinct vertices are adjacent. This is equivalent to the condition that the [[induced subgraph]] of {{mvar|G}} induced by {{mvar|C}} is a [[complete graph]]. In some cases, the term clique may also refer to the subgraph directly.

A '''maximal clique''' is a clique that cannot be extended by including one more adjacent vertex, that is, a clique which does not exist exclusively within the vertex set of a larger clique. Some authors define cliques in a way that requires them to be maximal, and use other terminology for complete subgraphs that are not maximal.

A '''maximum clique''' of a graph, {{mvar|G}}, is a clique, such that there is no clique with more vertices. Moreover, the '''clique number''' {{math|''ω''(''G'')}} of a graph {{mvar|G}} is the number of vertices in a maximum clique in {{mvar|G}}.

The '''[[intersection number (graph theory)|intersection number]]''' of {{mvar|G}} is the smallest number of cliques that together cover all edges of {{mvar|G}}.

The '''clique cover number''' of a graph {{mvar|G}} is the smallest number of cliques of {{mvar|G}} whose union covers the set of vertices {{mvar|V}} of the graph.

A '''maximum clique transversal''' of a graph is a subset of vertices with the property that each maximum clique of the graph contains at least one vertex in the subset.{{sfnp|Chang|Kloks|Lee|2001}}

The opposite of a clique is an '''[[independent set (graph theory)|independent set]]''', in the sense that every clique corresponds to an independent set in the [[complement graph]]. The [[clique cover]] problem concerns finding as few cliques as possible that include every vertex in the graph.

A related concept is a '''biclique''', a [[complete bipartite graph|complete bipartite subgraph]]. The [[bipartite dimension]] of a graph is the minimum number of bicliques needed to cover all the edges of the graph.

==Mathematics==
Mathematical results concerning cliques include the following.
* [[Turán's theorem]] gives a [[lower bound]] on the size of a clique in [[dense graph]]s.{{sfnp|Turán|1941}}  If a graph has sufficiently many edges, it must contain a large clique. For instance, every graph with <math>n</math> vertices and more than <math>\scriptstyle \left\lfloor\frac{n}{2}\right\rfloor \cdot \left\lceil\frac{n}{2}\right\rceil</math> edges must contain a three-vertex clique.
* [[Ramsey's theorem]] states that every graph or its [[complement graph]] contains a clique with at least a logarithmic number of vertices.{{sfnp|Graham|Rothschild|Spencer|1990}}
* According to a result of {{harvtxt|Moon|Moser|1965}}, a graph with 3''n'' vertices can have at most 3<sup>''n''</sup> maximal cliques. The graphs meeting this bound are the Moon–Moser graphs ''K''<sub>3,3,...</sub>, a special case of the [[Turán graph]]s arising as the extremal cases in Turán's theorem.
* [[Hadwiger conjecture (graph theory)|Hadwiger's conjecture]], still unproven, relates the size of the largest clique [[graph minor|minor]] in a graph (its [[Hadwiger number]]) to its [[chromatic number]].
* The [[Erdős–Faber–Lovász conjecture]] relates graph coloring to cliques.
* The [[Erdős–Hajnal conjecture]] states that families of graphs defined by [[forbidden graph characterization]] have either large cliques or large [[Coclique|cocliques]]. 

Several important classes of graphs may be defined or characterized by their cliques:
* A [[cluster graph]] is a graph whose [[connected component (graph theory)|connected components]] are cliques.
* A [[block graph]] is a graph whose [[biconnected component]]s are cliques.
* A [[chordal graph]] is a graph whose vertices can be ordered into a perfect elimination ordering, an ordering such that the [[neighborhood (graph theory)|neighbors]] of each vertex ''v'' that come later than ''v'' in the ordering form a clique.
* A [[cograph]] is a graph all of whose induced subgraphs have the property that any maximal clique intersects any [[maximal independent set]] in a single vertex.
* An [[interval graph]] is a graph whose maximal cliques can be ordered in such a way that, for each vertex ''v'', the cliques containing ''v'' are consecutive in the ordering.
* A [[line graph]] is a graph whose edges can be covered by edge-disjoint cliques in such a way that each vertex belongs to exactly two of the cliques in the cover.
* A [[perfect graph]] is a graph in which the clique number equals the [[chromatic number]] in every [[induced subgraph]].
* A [[split graph]] is a graph in which some clique contains at least one endpoint of every edge.
* A [[triangle-free graph]] is a graph that has no cliques other than its vertices and edges.

Additionally, many other mathematical constructions involve cliques in graphs. Among them,
* The [[clique complex]] of a graph ''G'' is an [[abstract simplicial complex]] ''X''(''G'') with a simplex for every clique in ''G''
* A [[simplex graph]] is an undirected graph κ(''G'') with a vertex for every clique in a graph ''G'' and an edge connecting two cliques that differ by a single vertex. It is an example of [[median graph]], and is associated with a [[median algebra]] on the cliques of a graph: the median ''m''(''A'',''B'',''C'') of three cliques ''A'', ''B'', and ''C'' is the clique whose vertices belong to at least two of the cliques ''A'', ''B'', and ''C''.<ref>{{harvtxt|Barthélemy|Leclerc|Monjardet|1986}}, page 200.</ref>
* The [[clique-sum]] is a method for combining two graphs by merging them along a shared clique.
* [[Clique-width]] is a notion of the complexity of a graph in terms of the minimum number of distinct vertex labels needed to build up the graph from disjoint unions, relabeling operations, and operations that connect all pairs of vertices with given labels. The graphs with clique-width one are exactly the disjoint unions of cliques.
* The [[Intersection number (graph theory)|intersection number]] of a graph is the minimum number of cliques needed to cover all the graph's edges.
* The [[clique graph]] of a graph is the [[intersection graph]] of its maximal cliques.

Closely related concepts to complete subgraphs are [[subdivision (graph theory)|subdivision]]s of complete graphs and complete [[graph minor]]s. In particular, [[Kuratowski's theorem]] and [[Wagner's theorem]] characterize [[planar graph]]s by forbidden complete and [[complete bipartite graph|complete bipartite]] subdivisions and minors, respectively.

==Computer science==
{{Main|Clique problem}}
In [[computer science]], the [[clique problem]] is the computational problem of finding a maximum clique, or all cliques, in a given graph. It is [[NP-complete]], one of [[Karp's 21 NP-complete problems]].{{sfnp|Karp|1972}} It is also [[parameterized complexity|fixed-parameter intractable]], and [[Hardness of approximation|hard to approximate]]. Nevertheless, many [[algorithm]]s for computing cliques have been developed, either running in [[exponential time]] (such as the [[Bron–Kerbosch algorithm]]) or specialized to graph families such as [[planar graph]]s or [[perfect graph]]s for which the problem can be solved in [[polynomial time]].

==Applications==
The word "clique", in its graph-theoretic usage, arose from the work of {{harvtxt|Luce|Perry|1949}}, who used complete subgraphs to model [[clique]]s (groups of people who all know each other) in [[social network]]s. The same definition was used by {{harvtxt|Festinger|1949}} in an article using less technical terms. Both works deal with uncovering cliques in a social network using matrices. For continued efforts to model social cliques graph-theoretically, see e.g. {{harvtxt|Alba|1973}}, {{harvtxt|Peay|1974}}, and {{harvtxt|Doreian|Woodard|1994}}.

Many different problems from [[bioinformatics]] have been modeled using cliques. For instance, {{harvtxt|Ben-Dor|Shamir|Yakhini|1999}} model the problem of clustering [[gene expression]] data as one of finding the minimum number of changes needed to transform a graph describing the data into a graph formed as the disjoint union of cliques; {{harvtxt|Tanay|Sharan|Shamir|2002}} discuss a similar [[biclustering]] problem for expression data in which the clusters are required to be cliques. {{harvtxt|Sugihara|1984}} uses cliques to model [[ecological niche]]s in [[food chain|food webs]]. {{harvtxt|Day|Sankoff|1986}} describe the problem of inferring [[evolutionary tree]]s as one of finding maximum cliques in a graph that has as its vertices characteristics of the species, where two vertices share an edge if there exists a [[perfect phylogeny]] combining those two characters. {{harvtxt|Samudrala|Moult|1998}} model [[protein structure prediction]] as a problem of finding cliques in a graph whose vertices represent positions of subunits of the protein. And by searching for cliques in a [[protein–protein interaction]] network, {{harvtxt|Spirin|Mirny|2003}} found clusters of proteins that interact closely with each other and have few interactions with proteins outside the cluster. [[Power graph analysis]] is a method for simplifying complex biological networks by finding cliques and related structures in these networks.

In [[electrical engineering]], {{harvtxt|Prihar|1956}} uses cliques to analyze communications networks, and {{harvtxt|Paull|Unger|1959}} use them to design efficient circuits for computing partially specified Boolean functions. Cliques have also been used in [[automatic test pattern generation]]: a large clique in an incompatibility graph of possible faults provides a lower bound on the size of a test set.<ref>{{harvtxt|Hamzaoglu|Patel|1998}}.</ref> {{harvtxt|Cong|Smith|1993}} describe an application of cliques in finding a hierarchical partition of an electronic circuit into smaller subunits.

In [[chemistry]], {{harvtxt|Rhodes|Willett|Calvet|Dunbar|2003}} use cliques to describe chemicals in a [[chemical database]] that have a high degree of similarity with a target structure. {{harvtxt|Kuhl|Crippen|Friesen|1983}} use cliques to model the positions in which two chemicals will bind to each other.

==See also==
* [[Clique game]]

==Notes==
{{reflist}}

==References==
{{refbegin}}
*{{citation |doi=10.1080/0022250X.1973.9989826 |first=Richard D. |last=Alba |title=A graph-theoretic definition of a sociometric clique |journal=Journal of Mathematical Sociology |year=1973 |volume=3 |issue=1 |pages=113–126 |url=http://aris.ss.uci.edu/~lin/1.pdf |access-date=2009-12-14 |archive-date=2011-05-03 |archive-url=https://web.archive.org/web/20110503220546/http://aris.ss.uci.edu/~lin/1.pdf |url-status=live }}.
*{{citation | last1 = Barthélemy | first1 = J.-P. | last2 = Leclerc | first2 = B. | last3 = Monjardet | first3 = B. | issue = 2 | journal = Journal of Classification | pages = 187–224 | title = On the use of ordered sets in problems of comparison and consensus of classifications | doi = 10.1007/BF01894188 | volume = 3 | year = 1986| s2cid = 6092438 }}.
*{{citation |first1=Amir |last1=Ben-Dor |first2=Ron |last2=Shamir |first3=Zohar |last3=Yakhini |journal=Journal of Computational Biology |year=1999 |volume=6 |issue=3–4 |pages=281–297 |doi=10.1089/106652799318274 |pmid=10582567 |title=Clustering gene expression patterns.|citeseerx=10.1.1.34.5341 }}.
*{{citation
 | last1 = Chang | first1 = Maw-Shang
 | last2 = Kloks | first2 = Ton
 | last3 = Lee | first3 = Chuan-Min
 | contribution = Maximum clique transversals
 | doi = 10.1007/3-540-45477-2_5
 | mr = 1905299
 | pages = 32–43
 | publisher = Springer, Berlin
 | series = Lecture Notes in Comput. Sci.
 | title = Graph-theoretic concepts in computer science (Boltenhagen, 2001)
 | volume = 2204
 | year = 2001| isbn = 978-3-540-42707-0
 }}.
*{{citation |last1=Cong |first1=J. |last2=Smith |first2=M. |contribution=A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design |title=Proc. 30th International Design Automation Conference |year=1993 |pages=755–760 |doi=10.1145/157485.165119|isbn=978-0897915779 |citeseerx=10.1.1.32.735 |s2cid=525253 }}.
*{{citation |title=Computational complexity of inferring phylogenies by compatibility |first1=William H. E. |last1=Day |first2=David |last2=Sankoff |journal=Systematic Zoology |volume=35 |issue=2 |year=1986 |pages=224–229 |doi=10.2307/2413432 |jstor=2413432}}.
*{{citation |title=Defining and locating cores and boundaries of social networks |first1=Patrick |last1=Doreian |first2=Katherine L. |last2=Woodard |journal=Social Networks |volume=16 |issue=4 |year=1994 |pages=267–293 |doi=10.1016/0378-8733(94)90013-2}}.
*{{citation |first1=Paul |last1=Erdős |author1-link=Paul Erdős |first2=George |last2=Szekeres |author2-link=George Szekeres |title=A combinatorial problem in geometry |journal=Compositio Mathematica |volume=2 |year=1935 |pages=463–470 |url=http://www.renyi.hu/~p_erdos/1935-01.pdf |access-date=2009-12-19 |archive-date=2020-05-22 |archive-url=https://web.archive.org/web/20200522011619/https://www.renyi.hu/~p_erdos/1935-01.pdf |url-status=live }}.
*{{citation |doi=10.1177/001872674900200205 |first=Leon |last=Festinger |title=The analysis of sociograms using matrix algebra |journal=Human Relations |year=1949 |volume=2 |issue=2 |pages=153–158 |s2cid=143609308 }}.
*{{citation
 | last1 = Graham
 | first1 = R.
 | author1-link = Ronald Graham
 | last2 = Rothschild
 | first2 = B.
 | last3 = Spencer
 | first3 = J. H.
 | author3-link = Joel Spencer
 | location = New York
 | publisher = John Wiley and Sons
 | title = Ramsey Theory
 | year = 1990
 | isbn = 978-0-471-50046-9
 | url-access = registration
 | url = https://archive.org/details/ramseytheory0000grah
 }}.
*{{citation |last1=Hamzaoglu |first1=I. |last2=Patel |first2=J. H. |contribution=Test set compaction algorithms for combinational circuits |title=Proc. 1998 IEEE/ACM International Conference on Computer-Aided Design |year=1998 |pages=283–289 |doi=10.1145/288548.288615|isbn=978-1581130089 |s2cid=12258606 |doi-access=free }}.
*{{citation | last = Karp | first = Richard M. | author-link = Richard M. Karp | url = http://www.cs.berkeley.edu/~luca/cs172/karp.pdf | contribution = Reducibility among combinatorial problems | title = Complexity of Computer Computations | editor1-first = R. E. | editor1-last = Miller | editor2-first = J. W. | editor2-last = Thatcher | publisher = New York: Plenum | pages = 85&ndash;103 | year = 1972 | access-date = 2009-12-13 | archive-date = 2011-06-29 | archive-url = https://web.archive.org/web/20110629023717/http://www.cs.berkeley.edu/~luca/cs172/karp.pdf | url-status = dead }}.
*{{citation |first1=F. S. |last1=Kuhl |first2=G. M. |last2=Crippen |first3=D. K. |last3=Friesen |year=1983 |title=A combinatorial algorithm for calculating ligand binding |journal=Journal of Computational Chemistry |doi=10.1002/jcc.540050105 |volume=5 |issue=1 |pages=24–34|s2cid=122923018 }}.
*{{citation |first=Kazimierz |last=Kuratowski |author-link=Kazimierz Kuratowski |language=fr |title=Sur le problème des courbes gauches en Topologie |journal=Fundamenta Mathematicae |volume=15 |year=1930 |pages=271–283 |url=http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf |doi=10.4064/fm-15-1-271-283 |doi-access=free |access-date=2009-12-19 |archive-date=2018-07-23 |archive-url=https://web.archive.org/web/20180723184013/http://matwbn.icm.edu.pl/ksiazki/fm/fm15/fm15126.pdf |url-status=live }}.
*{{citation
 | last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
 | last2 = Perry | first2 = Albert D.
 | title = A method of matrix analysis of group structure 
 | journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
 | pages = 95–116 | doi = 10.1007/BF02289146
 | pmid = 18152948| hdl = 10.1007/BF02289146 | s2cid = 16186758 | hdl-access = free }}.
*{{citation
 | last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
 | title = On cliques in graphs
 | journal = [[Israel Journal of Mathematics]]
 | volume = 3
 | year = 1965
 | pages = 23–28
 | mr = 0182577 
 | doi = 10.1007/BF02760024 | doi-access=free}}.
*{{citation |first1=M. C. |last1=Paull |first2=S. H. |last2=Unger |title=Minimizing the number of states in incompletely specified sequential switching functions |journal=IRE Transactions on Electronic Computers |volume=EC-8 |issue=3 |year=1959 |pages=356–367 |doi=10.1109/TEC.1959.5222697}}.
*{{citation |title=Hierarchical clique structures |first=Edmund R. |last=Peay |journal=Sociometry |volume=37 |issue=1 |year=1974 |pages=54–65 |doi=10.2307/2786466 |jstor=2786466}}.
*{{citation |last=Prihar |first=Z. |title=Topological properties of telecommunications networks |journal=[[Proceedings of the IRE]] |volume=44 |issue=7 |year=1956 |pages=927–933 |doi=10.1109/JRPROC.1956.275149|s2cid=51654879 }}.
*{{citation |first1=Nicholas |last1=Rhodes |first2=Peter |last2=Willett |first3=Alain |last3=Calvet |first4=James B. |last4=Dunbar |first5=Christine |last5=Humblet |journal=Journal of Chemical Information and Computer Sciences |volume=43 |issue=2 |pages=443–448 |year=2003 |doi=10.1021/ci025605o |pmid=12653507 |title=CLIP: similarity searching of 3D databases using clique detection}}.
*{{citation |first1=Ram |last1=Samudrala |first2=John |last2=Moult |title=A graph-theoretic algorithm for comparative modeling of protein structure |journal=Journal of Molecular Biology |volume=279 |issue=1 |year=1998 |pages=287–302 |doi=10.1006/jmbi.1998.1689 |pmid=9636717|citeseerx=10.1.1.64.8918 }}.
*{{citation |first1=Victor |last1=Spirin |first2=Leonid A. |last2=Mirny |title=Protein complexes and functional modules in molecular networks |journal=[[Proceedings of the National Academy of Sciences]] |volume=100 |issue=21 |pages=12123–12128 |doi=10.1073/pnas.2032324100 |year=2003 |pmid=14517352 |pmc=218723|doi-access=free |bibcode=2003PNAS..10012123S }}.
*{{citation |first=George |last=Sugihara |contribution=Graph theory, homology and food webs |year=1984 |pages=83–101 |series=Proc. Symp. Appl. Math. |volume=30 |title=Population Biology |editor-last=Levin |editor-first=Simon A.}}.
*{{citation |first1=Amos |last1=Tanay |first2=Roded |last2=Sharan |first3=Ron |last3=Shamir |title=Discovering statistically significant biclusters in gene expression data |journal=Bioinformatics |volume=18 |issue=Suppl. 1 |year=2002 |pages=S136–S144 |pmid=12169541 |doi=10.1093/bioinformatics/18.suppl_1.S136|doi-access=free }}.
*{{citation
 | last = Turán
 | first = Paul | author-link = Pál Turán
 | year = 1941
 | title = On an extremal problem in graph theory
 | journal = Matematikai és Fizikai Lapok
 | volume = 48
 | pages = 436–452
 | language = hu
 }}
{{refend}}

==External links==
*{{MathWorld|title=Clique|urlname=Clique|mode=cs2}}
*{{MathWorld|title=Clique Number|urlname=CliqueNumber|mode=cs2}}

[[Category:Graph theory objects]]