 Giant component

A giant component in a sequence of random graphs on $n$ vertices has order proportional to $n$. Its existence can change at a threshold function for a monotone graph property. A giant component need not contain every vertex, and its uniqueness requires proof for the model in question.

In the context of graph theory and network theory, a "giant component" refers to a connected component of a graph that contains a significant fraction of the total number of vertices in that graph, especially as the number of vertices becomes very large. In large networks, like social networks or biological networks, there can be multiple connected components.