Is The Clique Algorithm by Ashay Dharwadker correct? When you write "clique algorithm" in Google www.dharwadker.org/clique/ appears as a 2nd result. Citation from abstract:

We present a new polynomial-time algorithm for finding maximal cliques in graphs. (...)  The algorithm finds a maximum clique in all known examples of graphs. In view of the importance of the P versus NP question, we ask if there exists a graph for which the algorithm cannot find a maximum clique.

In 4.4 it's written:

Given a simple graph G with n vertices, the algorithm takes less than
  $n^8+2n^7+n^6+n^5+n^4+n^3+n^2$ steps to terminate.

So, Dharwadker found an algorithm which is solving NP problem in P time... This would mean that P = NP...
Well, I'm not sure... My guess is that that Dharwadker's algorithm is not correct, i.e. for some input graph, algorithm will not work. That's why he is presenting only "all known examples of graphs", for which obviously his algorithm is working...
Is Dharwadker correct and we have a proof that P = NP? Or you can you present a counter example for his algorithm?
 A: From the paper's introduction (haven't and probably won't read the whole thing):

We prove that every graph with n vertices and minimum vertex degree $\delta$ must have a maximum clique of size at least $\lceil \frac n{n−\delta}\rceil$ and that the algorithm will always find a clique of at least this size.

This seems to be a reasonable claim. It does not actually solve the clique problem, since it only finds "large" cliques in a specific sense. However, he seems to be more interested in the Ramsey theory connection:

Furthermore, we prove that this condition is the best possible in terms of $n$ and $\delta$ by explicitly constructing graphs for which the size of a maximum clique is exactly $\lceil \frac n{n−\delta}\rceil$

I thought he might be misinterpreting the actual question, since finding a lower bound on maximal cliques and then demonstrating it is an upper bound on some graphs is not sufficient to solve the clique problem. But then he writes:

In Section 7, we demonstrate the algorithm by finding maximum cliques for several EXAMPLES of famous graphs, including two large benchmark graphs with hidden maximum cliques.

which seems to indicate that he does admit his algorithm does not find maximal cliques in all circumstances.
My judgement: I wouldn't dismiss it out of hand, the author is not obviously a crank, the algorithm might be correct and even interesting, but it does not solve P=NP.
A: This algorithm is not correct.
(Updated)
http://pastebin.com/KTqSgryK
Paste that file as grapt.txt for Dharwadker app - it won't find that first 5 vertices comprise a clique. This is an example of so-called greedy algorithm, that can quickly find pretty good solution for many start conditions, but its greed can drive it to a trap.
A: I doubt if it is correct. His profile tells us that apart from finding a polynomial time algorithm for maximal cliques in Graphs, he has also connected four color theorem to Standard Model in physics and has predicted Higgs-Boson from four color theorem apart from calculating  Einstein's cosmological constant in his spare time:
http://www.dharwadker.org/profile.html
He claims to be the founder and director of Institute of Mathematics, Gurgaon (India). Being an Indian, I can tell that I have never heard of this institute. Most likely he is an amateur mathematician.
