The Hajos construction is a simple, nondeterministic procedure for generating the class of graphs that are not 3-colorable. A.J. Mansfield and D.J.A. Welsh have posed the problem of proving whether or not there exists a polynomial-size Hajos construction for every non-3-colorable graph. The main result of this paper is a proof that the Hajos calculus is polynomially-bounded if and only if extended Frege proof systems are polynomially bounded. This result links an open problem in graph theory to an important open problem in the complexity of propositional proof systems. In addition, the authors establish an exponential lower bound for a strong subsystem of the Hajos calculus. Lastly, they discuss an interesting graph-theoretical consequence of this result.<<ETX>>
[1]
David S. Johnson,et al.
Some Simplified NP-Complete Graph Problems
,
1976,
Theor. Comput. Sci..
[2]
Jan Krajícek,et al.
Exponential Lower Bounds for the Pigeonhole Principle
,
1992,
STOC.
[3]
Stephen A. Cook,et al.
Feasibly constructive proofs and the propositional calculus (Preliminary Version)
,
1975,
STOC.
[4]
Stephen A. Cook,et al.
The Relative Efficiency of Propositional Proof Systems
,
1979,
Journal of Symbolic Logic.
[5]
Jan Krajícek,et al.
Propositional proof systems, the consistency of first order theories and the complexity of computations
,
1989,
Journal of Symbolic Logic.