In network theory, a giant component is a connected subgraph that contains a majority of the entire graph's nodes. Percolation theory is based on adding nodes and connections to an empty graph until a giant component surfaces.

[edit] External links

• The growth of a giant component
• The full development of a giant component

This combinatorics-related article is a stub. You can help Wikipedia by expanding it. v • d • e