
doi: 10.2307/2695110
AbstractThe problem of the existence of a universal structure omitting a finite set of forbidden substructures is reducible to the corresponding problem in the category of graphs with a vertex coloring by two colors. It is not known whether this problem reduces further to the category of ordinary graphs. It is also not known whether these problems are decidable.
universal structure, Undecidability and degrees of sets of sentences, graph, Models of other mathematical theories, forbidden subgraph, universal graph, Model theory of denumerable and separable structures, forbidden substructure, Decidability of theories and sets of sentences, Coloring of graphs and hypergraphs, colored graph, Structural characterization of families of graphs
universal structure, Undecidability and degrees of sets of sentences, graph, Models of other mathematical theories, forbidden subgraph, universal graph, Model theory of denumerable and separable structures, forbidden substructure, Decidability of theories and sets of sentences, Coloring of graphs and hypergraphs, colored graph, Structural characterization of families of graphs
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 9 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
