clique

团

Combinatorics · Undergraduate · Mathematics Resources editorial compilation (AI-assisted)

Translation evidence: Literature usage

Meaning in context

A clique in a simple graph is a vertex subset in which every pair of distinct vertices is adjacent, so its induced subgraph is complete.

简单图中的团是任意两个不同顶点都相邻的顶点子集，即其导出子图为完全图。

Example

Any three vertices of K4K_4 form a clique of size three.

Usage and distinctions

A clique need not be inclusion-maximal or of maximum size. Counting vertices and counting its edges give different parameters.

Recommended reading in this subject · Preparation & skip guidance

Definition sources

  1. Yufei Zhao — Graph Theory and Additive Combinatorics, author manuscriptSection 1.2, Forbidding a Clique: Turán’s Theorem, K_{r+1}-free formulation · Checked 2026-10-14

Translation sources

  1. 新疆大学 — 本科课程教学大纲汇编，图论（050762）PDF p.95 / printed p.94，图论课程四、第三部分，第七章「独立集和团」 · Checked 2026-10-14
Edit source / propose a PRReport a correction

Original encyclopedia and terminology content: CC BY-SA 4.0. Contribute or report a correction.