![]() |
Discrete Mathematics & Theoretical Computer Science |
We prove that the joint embedding property is undecidable for hereditary graph classes, via a reduction from the tiling problem. The proof is then adapted to show the undecidability of the joint homomorphism property as well.
Source : ScholeXplorer
HasVersion DOI 10.48550/arxiv.1903.11932
Braunfeld, Samuel ; |