Article contents
Forbidden subgraphs and forbidden substructures
Published online by Cambridge University Press: 12 March 2014
Abstract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Association for Symbolic Logic 2001
References
REFERENCES
- 8
- Cited by