## You are here

Homeindependent set and independence number

## Primary tabs

# independent set and independence number

A set of vertices in a graph $G$ is called an independent set if there are no edges between the vertices.

The independence number of a graph $G$, usually denoted by $\alpha(G)$, is the size of a maximal independent set in $G$. $\alpha(G)\geq\nu$ means that there are $\nu$ vertices with no edges between them.

An independent set is sometimes called a stable set or an anticlique.

Defines:

independent set, independence number

Related:

Clique2

Synonym:

stable set, anticlique

Type of Math Object:

Definition

Major Section:

Reference

Groups audience:

## Mathematics Subject Classification

05C69*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections