Discrete graph theory explains connectivity and colouring issues. Ramsey numbers (R(m,n)) are significant for this. Ramsey numbers illustrate the minimum number of vertices a whole graph requires to have a clique of size m or an independent set of size n, regardless of line colour. These numbers help us examine graphs’ unavoidable structures, as this article shows. They explain graph colouring, network resilience, and failure tolerance. Ramsey theory helps uncover one-color substructures that remain the same even when the edges are coloured. This suggests how interconnected social, conversation, and biological networks are. Ramsey numbers and their utilization in hypergraphs and multicolour setups are studied. We study the combinatorial challenge of finding R(m,n) in algorithmic graph theory. We discuss using probability approaches, recurrence relations, and external function constraints to estimate Ramsey numbers for larger graphs. Researchers are also studying Ramsey numbers and other graph invariants like chromatic quantity, clique quantity, and edge density to understand discrete graphs. These findings show Ramsey theory’s importance as a fundamental tool for tackling several discrete mathematical version connectivity and colouring challenges.