1,592
个编辑
更改
跳到导航
跳到搜索
Moved page from wikipedia:en:Clique (graph theory) (history)
此词条暂由彩云小译翻译，未经人工整理和审校，带来阅读不便，请见谅。
[[File:VR complex.svg|thumb|upright=1.35|A graph with {{unordered list
[[File:VR complex.svg|thumb|upright=1.35|A graph with {{unordered list
[文件: VR complex.svg | thumb | upright = 1.35 | a graph with { unordered list
| 23 × 1-vertex cliques (the vertices),
| 23 × 1-vertex cliques (the vertices),
| 23 × 1-vertex cliques (the vertices),
| 42 × 2-vertex cliques (the edges),
| 42 × 2-vertex cliques (the edges),
| 42 × 2-vertex cliques (the edges),
| 19 × 3-vertex cliques (light and dark blue triangles), and
| 19 × 3-vertex cliques (light and dark blue triangles), and
| 193顶点团(浅色和深蓝色三角形) ，以及
| 2 × 4-vertex cliques (dark blue areas).}}
| 2 × 4-vertex cliques (dark blue areas).}}
| 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.]]
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.]]
11个浅蓝色三角形形成最大团。两个深蓝色的4团都是最大团和最大团，图的团数为4。]
In the [[mathematics|mathematical]] area of [[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; that is, its [[induced subgraph]] 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.
In the mathematical area of graph theory, a clique ( or ) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is 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 (the clique problem) is NP-complete, but despite this hardness result, many algorithms for finding cliques have been studied.
在图论的数学领域中，团(或)是无向图的顶点的子集，使得团中每两个不同的顶点相邻，即它的导出子图是完全的。团是图论的基本概念之一，在许多其他数学问题和图的构造中也有应用。团问题在计算机科学中也有研究: 在一个图中是否存在一个给定大小的团(团问题)是 np 完全问题，但是尽管这个结果很困难，许多寻找团的算法已经被研究过。
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]].
Although the study of complete subgraphs goes back at least to the graph-theoretic reformulation of Ramsey theory by , the term clique comes from , who used complete subgraphs in social networks to model cliques 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.
虽然完全子图的研究至少可以追溯到 Ramsey 理论的图论重构，但是术语团来源于，他们在社会网络中使用完全子图来模拟人们的团体，即相互认识的人们的团体。小集团在科学，特别是在生物信息学中有许多其他的应用。
==Definitions==
A '''clique''', ''C'', in an [[undirected graph]] {{nowrap|''G'' {{=}} (''V'', ''E'')}} is a subset of the [[Vertex (graph theory)|vertices]], {{nowrap|''C'' ⊆ ''V''}}, such that every two distinct vertices are adjacent. This is equivalent to the condition that the [[induced subgraph]] of ''G'' induced by ''C'' is a [[complete graph]]. In some cases, the term clique may also refer to the subgraph directly.
A clique, C, in an undirected graph (V, E)}} is a subset of the vertices, , such that every two distinct vertices are adjacent. This is equivalent to the condition that the induced subgraph of G induced by C is a complete graph. In some cases, the term clique may also refer to the subgraph directly.
无向图(v，e)}中的团 c 是顶点的子集，使得每两个不同的顶点相邻。这等价于由 c 导出的 g 的导出子图是完全图的条件。在某些情况下，团这个术语也可以直接指子图。
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 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, ''G'', is a clique, such that there is no clique with more vertices. Moreover, the '''clique number''' ω(''G'') of a graph ''G'' is the number of vertices in a maximum clique in ''G''.
A maximum clique of a graph, G, is a clique, such that there is no clique with more vertices. Moreover, the clique number ω(G) of a graph G is the number of vertices in a maximum clique in G.
一个图 g 的最大团是一个团，这样就不存在多顶点的团。此外，图 g 的团数(g)是图 g 的最大团中的顶点数。
The '''[[intersection number (graph theory)|intersection number]]''' of ''G'' is the smallest number of cliques that together cover all edges of ''G''.
The intersection number of G is the smallest number of cliques that together cover all edges of G.
G 的交集数是覆盖 g 的所有边的团的最小个数。
The '''clique cover number''' of a graph ''G'' is the smallest number of cliques of ''G'' whose union covers the set of vertices ''V'' of the graph.
The clique cover number of a graph G is the smallest number of cliques of G whose union covers the set of vertices V of the graph.
图 g 的团覆盖数是 g 的团覆盖图的顶点集 v 的团的最小个数。
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}}
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.
图的最大团横截是指图的每个最大团在子集中至少包含一个顶点的顶点子集。
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.
The opposite of a clique is an 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.
A related concept is a biclique, a 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.
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\lfloor\frac{n}{2}\rfloor\cdot\lceil\frac{n}{2}\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]] is another unproven statement relating graph coloring to cliques.
Several important classes of graphs may be defined or characterized by their cliques:
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,
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.
Closely related concepts to complete subgraphs are subdivisions of complete graphs and complete graph minors. In particular, Kuratowski's theorem and Wagner's theorem characterize planar graphs by forbidden complete and 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]].
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. It is also fixed-parameter intractable, and hard to approximate. Nevertheless, many algorithms 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 graphs or perfect graphs for which the problem can be solved in polynomial time.
在计算机科学中，团的问题是在给定的图中找到一个最大团或所有团的计算问题。它是 np 完全问题，Karp 的21个 np 完全问题之一。它也是固定参数难以处理的，而且很难近似。尽管如此，许多计算团的算法已经被开发出来，或者运行在 EXPTIME 中(如 Bron-Kerbosch 算法) ，或者专门用于图族，如平面图或完美图，对于这些图族，问题可以在多项式时间内解决。
==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}}.
The word "clique", in its graph-theoretic usage, arose from the work of , who used complete subgraphs to model cliques (groups of people who all know each other) in social networks. The same definition was used by 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. , , and .
“小团体”这个词，在它的图论用法中，起源于年的工作，他使用完全子图来模拟小团体(所有互相认识的人组成的小团体)在社会网络中。同样的定义在一篇文章中也被使用了，这篇文章使用了一些不那么专业的术语。这两本书都使用矩阵处理社交网络中的小团体问题。为了继续努力建立社会小团体图形模型-理论上，见。、、及。
Many different problems from [[bioinformatics]] have been modeled using cliques.
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.
For instance, 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; discuss a similar biclustering problem for expression data in which the clusters are required to be cliques. uses cliques to model ecological niches in food webs. describe the problem of inferring evolutionary trees 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. 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, 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 electrical engineering, uses cliques to analyze communications networks, and 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. 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.
In chemistry, use cliques to describe chemicals in a chemical database that have a high degree of similarity with a target structure. 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}}.
*{{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}}.
*{{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
| last1 = Chang | first1 = Maw-Shang
1 = Chang | first1 = Maw-Shang
| last2 = Kloks | first2 = Ton
| last2 = Kloks | first2 = Ton
| last2 = Kloks | first2 = Ton
| last3 = Lee | first3 = Chuan-Min
| last3 = Lee | first3 = Chuan-Min
3 = Lee | first3 = Chuan-Min
| contribution = Maximum clique transversals
| contribution = Maximum clique transversals
| 贡献 = 最大团横截
| doi = 10.1007/3-540-45477-2_5
| doi = 10.1007/3-540-45477-2_5
| doi = 10.1007/3-540-45477-2 _ 5
| mr = 1905299
| mr = 1905299
1905299先生
| pages = 32–43
| pages = 32–43
| 页数 = 32-43
| publisher = Springer, Berlin
| publisher = Springer, Berlin
| publisher = Springer，Berlin
| series = Lecture Notes in Comput. Sci.
| series = Lecture Notes in Comput. Sci.
| 系列 = 计算机中的课堂讲稿。科学。
| title = Graph-theoretic concepts in computer science (Boltenhagen, 2001)
| title = Graph-theoretic concepts in computer science (Boltenhagen, 2001)
| title = 计算机科学中的图论概念(Boltenhagen，2001)
| volume = 2204
| volume = 2204
2204
| year = 2001| isbn = 978-3-540-42707-0
| year = 2001| isbn = 978-3-540-42707-0
| 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 }}.
*{{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}}.
*{{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 }}.
*{{citation
| last1 = Graham
| last1 = Graham
1 = Graham
| first1 = R.
| first1 = R.
1 = r.
| author1-link = Ronald Graham
| author1-link = Ronald Graham
| author1-link = Ronald Graham
| last2 = Rothschild
| last2 = Rothschild
| last2 = Rothschild
| first2 = B.
| first2 = B.
2 = b.
| last3 = Spencer
| last3 = Spencer
3 = Spencer
| first3 = J. H.
| first3 = J. H.
3 = j. h.
| author3-link = Joel Spencer
| author3-link = Joel Spencer
| author3-link = Joel Spencer
| location = New York
| location = New York
| 地点: 纽约
| publisher = John Wiley and Sons
| publisher = John Wiley and Sons
约翰威利父子出版社
| title = Ramsey Theory
| title = Ramsey Theory
拉姆齐理论
| year = 1990
| year = 1990
1990年
| isbn = 978-0-471-50046-9
| isbn = 978-0-471-50046-9
| isbn = 978-0-471-50046-9
| url-access = registration
| url-access = registration
| url-access = registration
| url = https://archive.org/details/ramseytheory0000grah
| url = https://archive.org/details/ramseytheory0000grah
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 }}.
*{{citation | last=Karp |first=Richard M. |authorlink = 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–103 | year = 1972}}.
*{{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}}.
*{{citation |first=Kazimierz |last=Kuratowski |authorlink=Kazimierz Kuratowski |language=French |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 }}.
*{{citation
| last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
| last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
1 = Luce | first1 = r. Duncan | author1-link = r. Duncan Luce
| last2 = Perry | first2 = Albert D.
| last2 = Perry | first2 = Albert D.
2 = Perry | first2 = Albert d.
| title = A method of matrix analysis of group structure
| title = A method of matrix analysis of group structure
| title = 群结构的矩阵分析方法
| journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
| journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
14 | issue = 2 | year = 1949
| pages = 95–116 | doi = 10.1007/BF02289146
| pages = 95–116 | doi = 10.1007/BF02289146
| pages = 95-116 | doi = 10.1007/BF02289146
| pmid = 18152948}}.
| pmid = 18152948}}.
18152948}.
*{{citation
| last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
| last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
1 = Moon | first1 = j. w. | author2-link = Leo Moser | last2 = Moser | first2 = l.
| title = On cliques in graphs
| title = On cliques in graphs
| title = 关于图中的团
| journal = Israel J. Math.
| journal = Israel J. Math.
以色列 j。数学。
| volume = 3
| volume = 3
3
| year = 1965
| year = 1965
1965年
| pages = 23–28
| pages = 23–28
23-28页
| mr = 0182577
| mr = 0182577
0182577先生
| doi = 10.1007/BF02760024}}.
| doi = 10.1007/BF02760024}}.
10.1007/BF02760024}.
*{{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}}.
*{{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}}.
*{{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
| last = Turán
| last = Turán
| first = Paul | authorlink = Pál Turán
| first = Paul | authorlink = Pál Turán
第一 = Paul | authorlink = Pál Turán
| year = 1941
| year = 1941
1941年
| title = On an extremal problem in graph theory
| title = On an extremal problem in graph theory
| title = 关于图论中的一个极值问题
| journal = Matematikai és Fizikai Lapok
| journal = Matematikai és Fizikai Lapok
| journal = Matematikai és Fizikai Lapok
| volume = 48
| volume = 48
48
| pages = 436–452
| pages = 436–452
| 页数 = 436-452
| language = Hungarian
| language = Hungarian
| language = 匈牙利语
}}
}}
}}
{{refend}}
==External links==
*{{MathWorld|title=Clique|urlname=Clique}}
*{{MathWorld|title=Clique Number|urlname=CliqueNumber}}
[[Category:Graph theory objects]]
Category:Graph theory objects
范畴: 图论对象
<noinclude>
<small>This page was moved from [[wikipedia:en:Clique (graph theory)]]. Its edit history can be viewed at [[团（图论）/edithistory]]</small></noinclude>
[[Category:待整理页面]]
[[File:VR complex.svg|thumb|upright=1.35|A graph with {{unordered list
[[File:VR complex.svg|thumb|upright=1.35|A graph with {{unordered list
[文件: VR complex.svg | thumb | upright = 1.35 | a graph with { unordered list
| 23 × 1-vertex cliques (the vertices),
| 23 × 1-vertex cliques (the vertices),
| 23 × 1-vertex cliques (the vertices),
| 42 × 2-vertex cliques (the edges),
| 42 × 2-vertex cliques (the edges),
| 42 × 2-vertex cliques (the edges),
| 19 × 3-vertex cliques (light and dark blue triangles), and
| 19 × 3-vertex cliques (light and dark blue triangles), and
| 193顶点团(浅色和深蓝色三角形) ，以及
| 2 × 4-vertex cliques (dark blue areas).}}
| 2 × 4-vertex cliques (dark blue areas).}}
| 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.]]
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.]]
11个浅蓝色三角形形成最大团。两个深蓝色的4团都是最大团和最大团，图的团数为4。]
In the [[mathematics|mathematical]] area of [[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; that is, its [[induced subgraph]] 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.
In the mathematical area of graph theory, a clique ( or ) is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent; that is, its induced subgraph is 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 (the clique problem) is NP-complete, but despite this hardness result, many algorithms for finding cliques have been studied.
在图论的数学领域中，团(或)是无向图的顶点的子集，使得团中每两个不同的顶点相邻，即它的导出子图是完全的。团是图论的基本概念之一，在许多其他数学问题和图的构造中也有应用。团问题在计算机科学中也有研究: 在一个图中是否存在一个给定大小的团(团问题)是 np 完全问题，但是尽管这个结果很困难，许多寻找团的算法已经被研究过。
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]].
Although the study of complete subgraphs goes back at least to the graph-theoretic reformulation of Ramsey theory by , the term clique comes from , who used complete subgraphs in social networks to model cliques 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.
虽然完全子图的研究至少可以追溯到 Ramsey 理论的图论重构，但是术语团来源于，他们在社会网络中使用完全子图来模拟人们的团体，即相互认识的人们的团体。小集团在科学，特别是在生物信息学中有许多其他的应用。
==Definitions==
A '''clique''', ''C'', in an [[undirected graph]] {{nowrap|''G'' {{=}} (''V'', ''E'')}} is a subset of the [[Vertex (graph theory)|vertices]], {{nowrap|''C'' ⊆ ''V''}}, such that every two distinct vertices are adjacent. This is equivalent to the condition that the [[induced subgraph]] of ''G'' induced by ''C'' is a [[complete graph]]. In some cases, the term clique may also refer to the subgraph directly.
A clique, C, in an undirected graph (V, E)}} is a subset of the vertices, , such that every two distinct vertices are adjacent. This is equivalent to the condition that the induced subgraph of G induced by C is a complete graph. In some cases, the term clique may also refer to the subgraph directly.
无向图(v，e)}中的团 c 是顶点的子集，使得每两个不同的顶点相邻。这等价于由 c 导出的 g 的导出子图是完全图的条件。在某些情况下，团这个术语也可以直接指子图。
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 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, ''G'', is a clique, such that there is no clique with more vertices. Moreover, the '''clique number''' ω(''G'') of a graph ''G'' is the number of vertices in a maximum clique in ''G''.
A maximum clique of a graph, G, is a clique, such that there is no clique with more vertices. Moreover, the clique number ω(G) of a graph G is the number of vertices in a maximum clique in G.
一个图 g 的最大团是一个团，这样就不存在多顶点的团。此外，图 g 的团数(g)是图 g 的最大团中的顶点数。
The '''[[intersection number (graph theory)|intersection number]]''' of ''G'' is the smallest number of cliques that together cover all edges of ''G''.
The intersection number of G is the smallest number of cliques that together cover all edges of G.
G 的交集数是覆盖 g 的所有边的团的最小个数。
The '''clique cover number''' of a graph ''G'' is the smallest number of cliques of ''G'' whose union covers the set of vertices ''V'' of the graph.
The clique cover number of a graph G is the smallest number of cliques of G whose union covers the set of vertices V of the graph.
图 g 的团覆盖数是 g 的团覆盖图的顶点集 v 的团的最小个数。
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}}
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.
图的最大团横截是指图的每个最大团在子集中至少包含一个顶点的顶点子集。
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.
The opposite of a clique is an 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.
A related concept is a biclique, a 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.
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\lfloor\frac{n}{2}\rfloor\cdot\lceil\frac{n}{2}\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]] is another unproven statement relating graph coloring to cliques.
Several important classes of graphs may be defined or characterized by their cliques:
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,
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.
Closely related concepts to complete subgraphs are subdivisions of complete graphs and complete graph minors. In particular, Kuratowski's theorem and Wagner's theorem characterize planar graphs by forbidden complete and 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]].
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. It is also fixed-parameter intractable, and hard to approximate. Nevertheless, many algorithms 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 graphs or perfect graphs for which the problem can be solved in polynomial time.
在计算机科学中，团的问题是在给定的图中找到一个最大团或所有团的计算问题。它是 np 完全问题，Karp 的21个 np 完全问题之一。它也是固定参数难以处理的，而且很难近似。尽管如此，许多计算团的算法已经被开发出来，或者运行在 EXPTIME 中(如 Bron-Kerbosch 算法) ，或者专门用于图族，如平面图或完美图，对于这些图族，问题可以在多项式时间内解决。
==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}}.
The word "clique", in its graph-theoretic usage, arose from the work of , who used complete subgraphs to model cliques (groups of people who all know each other) in social networks. The same definition was used by 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. , , and .
“小团体”这个词，在它的图论用法中，起源于年的工作，他使用完全子图来模拟小团体(所有互相认识的人组成的小团体)在社会网络中。同样的定义在一篇文章中也被使用了，这篇文章使用了一些不那么专业的术语。这两本书都使用矩阵处理社交网络中的小团体问题。为了继续努力建立社会小团体图形模型-理论上，见。、、及。
Many different problems from [[bioinformatics]] have been modeled using cliques.
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.
For instance, 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; discuss a similar biclustering problem for expression data in which the clusters are required to be cliques. uses cliques to model ecological niches in food webs. describe the problem of inferring evolutionary trees 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. 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, 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 electrical engineering, uses cliques to analyze communications networks, and 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. 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.
In chemistry, use cliques to describe chemicals in a chemical database that have a high degree of similarity with a target structure. 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}}.
*{{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}}.
*{{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
| last1 = Chang | first1 = Maw-Shang
1 = Chang | first1 = Maw-Shang
| last2 = Kloks | first2 = Ton
| last2 = Kloks | first2 = Ton
| last2 = Kloks | first2 = Ton
| last3 = Lee | first3 = Chuan-Min
| last3 = Lee | first3 = Chuan-Min
3 = Lee | first3 = Chuan-Min
| contribution = Maximum clique transversals
| contribution = Maximum clique transversals
| 贡献 = 最大团横截
| doi = 10.1007/3-540-45477-2_5
| doi = 10.1007/3-540-45477-2_5
| doi = 10.1007/3-540-45477-2 _ 5
| mr = 1905299
| mr = 1905299
1905299先生
| pages = 32–43
| pages = 32–43
| 页数 = 32-43
| publisher = Springer, Berlin
| publisher = Springer, Berlin
| publisher = Springer，Berlin
| series = Lecture Notes in Comput. Sci.
| series = Lecture Notes in Comput. Sci.
| 系列 = 计算机中的课堂讲稿。科学。
| title = Graph-theoretic concepts in computer science (Boltenhagen, 2001)
| title = Graph-theoretic concepts in computer science (Boltenhagen, 2001)
| title = 计算机科学中的图论概念(Boltenhagen，2001)
| volume = 2204
| volume = 2204
2204
| year = 2001| isbn = 978-3-540-42707-0
| year = 2001| isbn = 978-3-540-42707-0
| 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 }}.
*{{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}}.
*{{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 }}.
*{{citation
| last1 = Graham
| last1 = Graham
1 = Graham
| first1 = R.
| first1 = R.
1 = r.
| author1-link = Ronald Graham
| author1-link = Ronald Graham
| author1-link = Ronald Graham
| last2 = Rothschild
| last2 = Rothschild
| last2 = Rothschild
| first2 = B.
| first2 = B.
2 = b.
| last3 = Spencer
| last3 = Spencer
3 = Spencer
| first3 = J. H.
| first3 = J. H.
3 = j. h.
| author3-link = Joel Spencer
| author3-link = Joel Spencer
| author3-link = Joel Spencer
| location = New York
| location = New York
| 地点: 纽约
| publisher = John Wiley and Sons
| publisher = John Wiley and Sons
约翰威利父子出版社
| title = Ramsey Theory
| title = Ramsey Theory
拉姆齐理论
| year = 1990
| year = 1990
1990年
| isbn = 978-0-471-50046-9
| isbn = 978-0-471-50046-9
| isbn = 978-0-471-50046-9
| url-access = registration
| url-access = registration
| url-access = registration
| url = https://archive.org/details/ramseytheory0000grah
| url = https://archive.org/details/ramseytheory0000grah
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 }}.
*{{citation | last=Karp |first=Richard M. |authorlink = 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–103 | year = 1972}}.
*{{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}}.
*{{citation |first=Kazimierz |last=Kuratowski |authorlink=Kazimierz Kuratowski |language=French |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 }}.
*{{citation
| last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
| last1 = Luce | first1 = R. Duncan | author1-link = R. Duncan Luce
1 = Luce | first1 = r. Duncan | author1-link = r. Duncan Luce
| last2 = Perry | first2 = Albert D.
| last2 = Perry | first2 = Albert D.
2 = Perry | first2 = Albert d.
| title = A method of matrix analysis of group structure
| title = A method of matrix analysis of group structure
| title = 群结构的矩阵分析方法
| journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
| journal = Psychometrika | volume = 14 | issue = 2 | year = 1949
14 | issue = 2 | year = 1949
| pages = 95–116 | doi = 10.1007/BF02289146
| pages = 95–116 | doi = 10.1007/BF02289146
| pages = 95-116 | doi = 10.1007/BF02289146
| pmid = 18152948}}.
| pmid = 18152948}}.
18152948}.
*{{citation
| last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
| last1 = Moon | first1 = J. W. | author2-link = Leo Moser | last2 = Moser | first2 = L.
1 = Moon | first1 = j. w. | author2-link = Leo Moser | last2 = Moser | first2 = l.
| title = On cliques in graphs
| title = On cliques in graphs
| title = 关于图中的团
| journal = Israel J. Math.
| journal = Israel J. Math.
以色列 j。数学。
| volume = 3
| volume = 3
3
| year = 1965
| year = 1965
1965年
| pages = 23–28
| pages = 23–28
23-28页
| mr = 0182577
| mr = 0182577
0182577先生
| doi = 10.1007/BF02760024}}.
| doi = 10.1007/BF02760024}}.
10.1007/BF02760024}.
*{{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}}.
*{{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}}.
*{{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
| last = Turán
| last = Turán
| first = Paul | authorlink = Pál Turán
| first = Paul | authorlink = Pál Turán
第一 = Paul | authorlink = Pál Turán
| year = 1941
| year = 1941
1941年
| title = On an extremal problem in graph theory
| title = On an extremal problem in graph theory
| title = 关于图论中的一个极值问题
| journal = Matematikai és Fizikai Lapok
| journal = Matematikai és Fizikai Lapok
| journal = Matematikai és Fizikai Lapok
| volume = 48
| volume = 48
48
| pages = 436–452
| pages = 436–452
| 页数 = 436-452
| language = Hungarian
| language = Hungarian
| language = 匈牙利语
}}
}}
}}
{{refend}}
==External links==
*{{MathWorld|title=Clique|urlname=Clique}}
*{{MathWorld|title=Clique Number|urlname=CliqueNumber}}
[[Category:Graph theory objects]]
Category:Graph theory objects
范畴: 图论对象
<noinclude>
<small>This page was moved from [[wikipedia:en:Clique (graph theory)]]. Its edit history can be viewed at [[团（图论）/edithistory]]</small></noinclude>
[[Category:待整理页面]]