Local feature matching is not robust to extract correct correspondences under many conditions, such as images with general deformations and repetitive patterns. To solve this problem, this paper proposes a new geometric constraint method: Maximal Clique Matching (MCM). In MCM, the global geometric constraint problem can be expressed as the maximal clique problem in graph theory. MCM starts from building a geometric correspondence graph (GCG) based upon the pairwise geometric information in local features, and then an efficient heuristic approximation algorithm is developed to get the global geometric relationships by finding the maximal cliques in GCG. Given the characteristics of the global optimality of maximal cliques, MCM is robust to occlusion, clutter, deformations and repetitive patterns. We evaluated the method using two public datasets. Results show that our method outperforms other up-to-date techniques.