In this paper we establish that decidingt-colorability for a simplek-graph whent≧3,k≧3 is NP-complete. Next, we establish that if there is a polynomial time algorithm for finding the chromatic number of a Steiner Triple system then there exists a polynomial time “approximation” algorithm for the chromatic number of simple 3-graphs. Finally, we show that the existence of such an approximation algorithm would imply that P=NP.
AMS subject classification 1980
68 E 99 51 E 10, 05 B 05, 05 C 65
This is a preview of subscription content, log in to check access.
P. Erdős andL. Lovász, Problems and results on 3-chromatic hypergraphs and related questions,Infinite and Finite Sets, Proc. Conf. Keszthely (1973),Colloq. Math. Soc. J. Bolyai10. 609–627.Google Scholar
E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.Google Scholar
C. C. Lindner, A partial Steiner triple system of ordern can be embedded in a Steiner triple system of order 6n + 3,J. Combinatorial Theory (A),18 (1975), 349–351.zbMATHCrossRefMathSciNetGoogle Scholar
C. C. Lindner, A survey of embedding theorems for Steiner systems, in:Topics on Steiner Systems, Ann. Discrete Math.7 (1980), 175–202.zbMATHMathSciNetGoogle Scholar
L. Lovász, Coverings and colorings of hypergraphs,Proc.45th Southeastern Conf. Combinatorics, Graph Theory, Computing (1973), 3–12.Google Scholar
K. T. Phelps, V. Rödl anddeBrandes, Coloring Steiner triple Systems,SIAM Alg. and Discrete Methods (to appear).Google Scholar