TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Open Access Research Article

Application of Ramsey numbers R(m,n) in analyzing connectivity and coloring problems in discrete graphs

, , * , , ,

* Corresponding author · click or hover a name for details

pp. 461–468Vol. 29Issue 2-AFebruary 2026DOI: 10.47974/JDMSC-2478 Crossmark XML
Received:
08 Apr 2025
Published Online:
31 Dec 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2478
Pages:
461–468

Abstract

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.

Keywords

Subject Classifications

05C15

References

[1] G. Barbu, “FA-LLLing for RSA: Lattice-based Fault Attacks against RSA Encryption and Signature,” 2022 Workshop on Fault Detection and Tolerance in Cryptography (FDTC), Italy, pp. 30–37 (2022).
[2] Z. Chen, C. Liu, F. Li, and S. C.-I. Chen, “Security Analysis of Another Vulnerability to RSA Algorithm,” 2023 13th Int. Conf. on Information Technology in Medicine and Education (ITME), Wuyishan, China, pp. 434–438 (2023).
[3] Z. Liu, C. Cao, R. Xu, C. Liu, and P. K. M. Bi, “Analysis of Two Papers Based on RSA Algorithm: Plagiarism Investigation of HRSA Algorithm,” 2024 14th Int. Conf. on Information Technology in Medicine and Education (ITME), Guiyang, China, pp. 461–465 (2024).
[4] N. D. Garisto, “This Month in Physics History September 2002: Schön Scandal Report is Released,” American Physical Society (Aug. 2022).
[5] C. Nguyen and A. Costa, “Anomaly Detection in Network Traffic using Machine Learning Techniques,” ITSI Trans. Electr. Electron. Eng., vol. 13, no. 1, pp. 1–7 (2025).
[6] G. Iovane, C. Bisogni, L. De Maio, and M. Nappi, “An Encryption Approach Using Information Fusion Techniques Involving Prime Numbers and Face Biometrics,” IEEE Trans. Sustain. Comput., vol. 5, no. 2, pp. 260–267 (Apr.–Jun. 2020).
[7] C.-H. Hsia, S.-J. Lou, H.-H. Chang, and D. Xuan, “Novel Hybrid Public/Private Key Cryptography Based on Perfect Gaussian Integer Sequences,” IEEE Access, vol. 9, pp. 145045–145059 (2021).
[8] B. Sankhyan, S. Sharma, and M. Singh, “Exploring Modern Cryptographic Algorithms: An Experimental Analysis,” 2024 15th Int. Conf. on Computing Communication and Networking Technologies (ICCCNT), Kamand, India, pp. 1–7 (2024).
[9] G. G. Sayyad, A. Salaskar, B.-P. Vishwajeet, B. Ghadage, and G. Khadatare, “Dynamic Gesture-Based Mathematical Interfaces and Problem Solvers: A Survey of Emerging Trends, Innovations, and Future Opportunities,” Int. J. Recent Adv. Eng. Technol., vol. 13, no. 2, pp. 48–54 (2025).
[10] A. Godbole, R. Dhabliya, V. Deshpande, S. A. Sivakumar, B. M. Shankar, and V. Khetani, “Ethical hacking and penetration testing strengthening cybersecurity posture through offensive security measures,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 4, pp. 1295–1305 (2024).

Views: 77Downloads: 15Citations: 0