The aim of this thesis was to prove and present the applications of one of the central theorems in the field of combinatorics, Hall’s theorem. Through the first part of the thesis we have expressed its combinatorial formulation, equivalence in terms of graph theory and matching and provided four different proofs. The first statement of the theorem gives the necessary and suficient condition for the existence of a system of distinct representatives of given sets. A simple generalization leads to the statement of Hall’s theorem in terms of graph theory, which speaks of a necessary and suficient condition for the existence of complete matching in a bipartite graph. At the end of the second chapter, several consequences from the field of combinatorics, set theory, group theory and linear algebra are presented. Furthermore, in the last chapter we have shown that Hall’s theorem is one in a sequence of equivalent theorems whose application extends to many areas of mathematics, so the motivation we saw at the beginning of the paper is diverse. Among the equivalent theorems, in addition to Hall’s theorem, there are Koenig’s, Dilworth’s, Menger’s, Birkhoff-Von Neumann theorem, and others. These theorems are stated and proved in this thesis and their application is presented. We have seen that the objects observed in these theorems vary from simple graphs (Menger’s and Koenig’s theorem), binary matrices (Koenig’s theorem) and doubly stochastic matrices (Birkhoff-Von Neumann theorem) to partially ordered sets (Dilworth’s theorem). We were also introduced to Latin rectangles, another specific type of matrix, and have shown that Hall’s theorem is responsible for proving one of the most important theorems in Latin rectangles.