• DOI:10.1017/S0305004100063428
• Corpus ID: 122772888

The group of the countable universal graph

@article{Truss1985TheGO,
  title={The group of the countable universal graph},
  author={John Kenneth Truss},
  journal={Mathematical Proceedings of the Cambridge Philosophical Society},
  year={1985},
  volume={98},
  pages={213 - 245}
}

• J. Truss
• Published 1 September 1985
• Mathematics
• Mathematical Proceedings of the Cambridge Philosophical Society

Let C be a set with at least two, and at most ℵ0, members, and for any set X let [X]2 denote the set of its 2-element subsets. If Γ is a countable set, and Fc is a function from [Γ]2 into C, then the structure Γc = (Γ, Fc) is called the countable universal C-coloured graph if the following condition is satisfied: Whenever α is a map from a finite subset of Γ into C there is xεΓ–dom α such that (∀yεdom α) Fc {x, y} = α(y).