The Clique Problem with Collaborative Variables (P=NP)
John Gillis · viXra · 2020
The present paper provides a novel approach to solving the clique problem(s). The present methods will work for any clique problem, including those which are determined to be NP-Complete. Determining other cliques, such as cliques of a fixed size (k=3, k=4, etc.) is trivial by comparison but will also be described. The author provides a means for greatly reducing the time that it will take a computer (or human) to solve for: 1. Maximum clique (a clique with the largest possible number of vertices), 2. Listing all maximal cliques (cliques that cannot be enlarged), and 3. Solving the decision problem of testing whether a graph contains a clique larger than a given size. To solve the clique problem, the author feels that we must completely discard previous graphing methods and start from scratch with his new and novel strategy.