The Erdős–Rényi Model is a foundational concept in graph theory that describes how random graphs are formed. It was introduced by mathematicians Paul Erdős and Alfréd Rényi in the 1950s. In this model, a graph is created by connecting a set of n vertices with edges that are added randomly. Each possible edge between two vertices has a fixed probability p of being included in the graph. This model helps researchers understand the properties of random networks, such as connectivity and the emergence of clusters. It serves as a basis for studying more complex networks found in various fields, including biology, sociology, and computer science.