---
tag: 7KK95ZW58R
kind: concept
name: Giant
sources:
  - wikipedia: en:325802@r1373839425
    locator: Glossary of graph theory, section G
    note: adopted
    mention: wikipedia://en/325802#C99E
    sections: [Summary]
inventory: [730N49EHKN]
---

## Summary

In the theory of random graphs, a giant component is a connected component that contains a constant fraction of the vertices of the graph. In standard models of random graphs, there is typically at most one giant component.