The chapter 4 provides an inclusive study of the mathematical theory of Relations, transitioning from the fundamental concepts of set theory to their practical and abstract applications in Discrete Mathematics. It begins by introducing the Cartesian Product of sets as the structural foundation for defining relationships between elements of objects of sets. Through a series of "Experiential Learning" experiments and brainstorming sessions, ranging from student college admissions to social dynamics, the text illustrates how complex real-world scenarios are modeled using mathematical notations. The chapter systematically categorizes various types of relations, including reflexive, symmetric, transitive, antisymmetric, and compatible relations, while providing rigorous definitions and proofs for each. Advanced topics such as composite relations, equivalence classes, set partitions, and Partial Ordering Relations (POSETS) are also discussed. It also focuses on the closure properties, offering step-by-step algorithmic approaches like Warshall’s Algorithm and Matrix Method for determining transitive closures. The chapter concludes with case studies, projects and exercises designed to bridge the gap between theoretical relational structures and their multidisciplinary applications.