Employing the Erdős–Ko–Rado theorem to develop new techniques in combinatorial intersection theory
Sheela Hundekarisheela.hundekari@pcu.edu.inSchool of Computer ApplicationsPimpri Chinchwad UniversityPune, Maharashtra, 412106, IndiaView full profile → , Sagarkumar S. Badhiyesagarbadhiye@gmail.comDepartment of Computer Science and EngineeringNagpur Campus, Symbiosis International (Deemed University)Symbiosis Institute of TechnologyPune, Maharashtra, IndiaView full profile → , *Pallavi R. RegeCorresponding authorpallavi.rege@viit.ac.inDepartment of Computer EngineeringVishwakarma Institute of Information TechnologyPune, Maharashtra, 411037, IndiaView full profile → , Budigi Prabhakarbudigi.prabhakar@niu.edu.inDepartment of PhysicsNoida International UniversityGreater Noida, Uttar Pradesh, 203201, IndiaView full profile → , K. Nagendra Prasadnagendraprasad1@gmail.comDepartment of Computer Science and Engineering - Artificial IntelligenceKKR and KSR Institute of Technology and SciencesGuntur, Andhra Pradesh, 522017, IndiaView full profile → , S. Udaya Lakshmisulakshmi04@gmail.comDepartment of Computer Science & EngineeringKITS Akshar Institute of TechnologyGuntur, Andhra Pradesh, 522019, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 08 Apr 2025
- Published Online:
- 31 Dec 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2482
- Pages:
- 271–279
Abstract
Keywords
Subject Classifications
References
[1] B. A. Atakul, “Independent transversal domination number of corona and join operation in path graphs,” Turk. J. Sci., vol. 7, pp. 7–13 (2022).
[2] Y. Akuzum, “The complex-type Pell p-numbers in finite groups,” Turk. J. Sci., vol. 6, pp. 142–147 (2021).
[3] P. Renteln, “On the spectrum of the derangement graph,” Electron. J. Comb., vol. 14, p. R82 (2007).
[4] J. Guo and K. Wang, “An Erdős-Ko-Rado theorem in general linear groups,” arXiv preprint, arXiv:1107.3178v1 (2011).
[5] C. Y. Ku and K. B. Wong, “A non-trivial intersection theorem for permutations with fixed number of cycles,” Discrete Math., vol. 339, pp. 646–657 (2016).
[6] C. Y. Ku and K. B. Wong, “On cross-intersecting families of set partitions,” Electron. J. Comb., vol. 19, p. P49 (2012).
[7] J. Wang and H. Zhang, “Cross-intersecting families and primitivity of symmetric systems,” J. Comb. Theory, Ser. A, vol. 118, pp. 455–462 (2011).
[8] P. Deshmukh and B. Carter, “Quantum machine learning: Algorithms and applications in quantum computing,” Int. J. Adv. Electr. Comput. Eng., vol. 13, no. 1, pp. 1–8 (2025).
[9] M. Alate, U. R. Godase, U. T. Kumbhar, S. Hundekari, A. A. Deshmukh, and A. Kumar, “Secure and scalable data aggregation techniques for healthcare monitoring in WSN,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 2-A, pp. 441–452 (2024).
[10] D. Ellis, E. Friedgut, and H. Pilpel, “Intersecting families of permutations,” J. Amer. Math. Soc., vol. 24, pp. 649–682 (2011).
[11] S. R. Reddy and A. Walker, “Towards explainable artificial intelligence: Interpretable models and techniques,” Int. J. Adv. Electr. Comput. Eng., vol. 13, no. 1, pp. 17–24 (2025).
