Abstract
The sort of question to be considered has the following form. Suppose we are given arecursive graph G, with vertex set V and edge set E. By “recursive” we mean (very roughly, but good enough for almost all purposes) that there is an effective algorithm which will allow us to compute in finitely many steps whether or not a givenx is in V, and also for given x,y to determine whether or not there is an edge in E joining them. For example, if G is finite, then it is recursive (but this case really is of no interest). It is usually quite safe to assume that V is just the set ω of natural numbers, or, perhaps, a recursive subset of ω. Next suppose that G is n-colorable, by which is meant that there is a function ϕ:V→ 0,1,2,…,n-l such that if x,y ∈V are adjacent, then ϕ (x) ≠ ϕ (y). Now the question: is G recursively n-colorable? I.e., is there a recursive n-coloring ϕ ofG? If not, is there some k for which there is a recursive k-coloring ofG? More generally, what conditions can be imposed on a recursive n-colorable graph which will guarantee that it is recursively k-colorable?
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Bean, D. (1976) Effective coloration, J. Symb. Logic 41, 469–480.
Gurevich, Y., and Shelah, S. (to appear) Annals of Pure and Applied Logic.
Holyer, Ian (1981) The NP-completeness of edge-coloring, SIAM J. Comput. 10, 718–720.
Jockusch, C. (1972) Ramsey’s Theorem and recursion theory, J. Symb. Logic 37, 268–279.
Kierstead, Henry A. (1981) An effective version of Dilworth’s Theorem, Trans. Amer. Math. Soc. 268, 63–77.
Kierstead, Henry A. (1981) Recursive colorings of highly recursive graphs, Canad. J. Math. 33, 1279–1290.
Kierstead, Henry A., and Trotter, William T., Jr. (1981) An extremal problem in recursive combinatorics, Congress Num. 33, 143–153.
Kierstead, Henry A. (1983) An effective version of Hall’s theorem, Proc. Amer. Math. Soc. 88, 124–128.
Kierstead, Henry A., McNulty, G.F., Trotter, William T., Jr. A theory of recursive dimension for ordered sets, Order 1, 67.
Lerman, M., and Schmerl, J.H. (1979) Theories with recursive models, J. Symb. Logic 44, 59–76.
Manaster, A., and Rosenstein, J.G. (1972) Effective matchmaking (recursion theoretic aspects of a theorem of Philip Hall), Proc. London Math. Soc. 25, 615–654.
Manaster, A.B., and Rosenstein, J.G. (1973) Effective matchmaking and k-chromatic graphs, Proc. Amer. Math. Soc. 39, 371–378.
Paris, J., and Harrington, L. A mathematical incompleteness in Peano Arithmetic, in: Handbook of Mathematical Logic (J. Barwise, ed. ), North-Holland, 1133–1142.
Rabin, M.O. (1969) Decidability of second-order theories and automata on finite trees, Trans. Amer. Math. Soc. 141, 1–35.
Schmerl, James H. Arborescent structures, I: Recursive models, in: Aspects of Effective Algebra (J.N. Crossley, ed. ), Upside Down A Book Co., 226–231.
Schmerl, James H. (1980) Decidability and ℵ0-categoricity of theories of partially ordered sets, J. Symb. Logic 45, 585–611.
Schmerl, James H. (1980) Recursive colorings of graphs, Canad. J. Math. 32, 821–830.
Schmerl, James H. (1982) The effective version of Brooks’ theorem, Canad. J. Math. 34, 1036–1046.
Tverberg, Helge (to appear) On Schmerl’s effective version of Brooks’ Theorem, J. Comb. Th. (Ser. B).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 D. Reidel Publishing Company
About this chapter
Cite this chapter
Schmerl, J.H. (1985). Recursion Theoretic Aspects of Graphs and Orders. In: Rival, I. (eds) Graphs and Order. NATO ASI Series, vol 147. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5315-4_13
Download citation
DOI: https://doi.org/10.1007/978-94-009-5315-4_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8848-0
Online ISBN: 978-94-009-5315-4
eBook Packages: Springer Book Archive