Submitted:
17 February 2026
Posted:
27 February 2026
You are already at the latest version
Abstract
The P versus NP problem, a conjecture formulated by Stephen Cook in 1971, is one of the most challenging problems in contemporary mathematics and theoretical computer science. A concise mathematical formulation of the problem reads: is P = NP? In longer phrasing, this asks: given a problem instance, if some additional data can be recognized fast enough as logically implying the existence of a solution (to the instance), then can a so- lution be computed fast enough? we formulate three problems in graph imbedding to show P ≠ NP.
Keywords:
algorithm
; polynomial time
; graph imbedding
; cliques
; Hamiltonian graphs
; dominating sets
; classes P and NP
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
