Open Access
Research Article·pp. 461–468·Vol. 29, Issue 2-AFeb 2026
Application of Ramsey numbers R(m,n) in analyzing connectivity and coloring problems in discrete graphs
Vaishali Rahate, Sagarkumar S. Badhiye, Parikshit Mahalle, Veerendra Yadav, G. V. K. Kishore, G. Mahesh Reddy
Published Online: 31 Dec 2025DOI: 10.47974/JDMSC-2478
In this paper: 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 h...
