Two conjectures such that the proof of any one of them will lead to the proof that P = NP

Malay Dutta

In this paper we define a construct called a time-graph. A complete time-graph of order n is the cartesian product of a complete graph with n vertices and a linear graph with n ver…