Forbidden Subgraphs and Forbidden Substructures
Cherlin, Gregory ; Shi, Niandong
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 1342-1352 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
The 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.
Publié le : 2001-09-14
Classification:  
@article{1183746563,
     author = {Cherlin, Gregory and Shi, Niandong},
     title = {Forbidden Subgraphs and Forbidden Substructures},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 1342-1352},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746563}
}

Cherlin, Gregory; Shi, Niandong. Forbidden Subgraphs and Forbidden Substructures. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  1342-1352. http://gdmltest.u-ga.fr/item/1183746563/