1985/09/01 by J. K. Truss · 3 citations
Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics #Computer science #Countable set #Discrete mathematics #Graph #Limits and Structures in Graph Theory #Mathematics #Set (abstract data type) #semigroups and automata theory
paper · doi:10.1017/s0305004100063428
openalex publication_date 1985/09/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/21
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 F c is a function from [Γ] 2 into C, then the structure Γ c = (Γ, F c ) 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 α) F c x, y = α(y).