Skip to Main Content

Transactions of the American Mathematical Society

Published by the American Mathematical Society since 1900, Transactions of the American Mathematical Society is devoted to longer research articles in all areas of pure and applied mathematics.

ISSN 1088-6850 (online) ISSN 0002-9947 (print)

The 2020 MCQ for Transactions of the American Mathematical Society is 1.48.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

The first order theory of $N$-colorable graphs
HTML articles powered by AMS MathViewer

by William H. Wheeler PDF
Trans. Amer. Math. Soc. 250 (1979), 289-310 Request permission

Abstract:

Every N-colorable graph without loops or multiple edges is a substructure of a direct power of a particular, finite, N-coloarable graph. Consequently, the class of N-colorable graphs without loops or endpoints can be recursively axiomatized by a first order, universal Horn theory. This theory has a model-companion which has a primitive recursive elimination of quantifiers and is decidable, complete, ${\aleph _0}$-categorical, and independent. The N-colorable graphs without loops or multiple edges which have a proper, prime model extension for the model-companion are precisely the finite, amalgamation bases.
References
Similar Articles
Additional Information
  • © Copyright 1979 American Mathematical Society
  • Journal: Trans. Amer. Math. Soc. 250 (1979), 289-310
  • MSC: Primary 03C65; Secondary 03B30, 03C10, 03C35, 05C15
  • DOI: https://doi.org/10.1090/S0002-9947-1979-0530057-2
  • MathSciNet review: 530057