Slice rank methods are new combinatorial tools introduced by Croot, Lev, and Pach in 2016. Many problems in extremal combinatorics are improved by applying the slice rank methods. In this thesis, we'll introduce the slice rank methods and their applications. Moreover, the partition rank and one of its applications are also introduced. Finally, we use slice rank methods and a random graph theorem to prove the right angles removal lemma.