The undecidability of joint embedding and joint homomorphism for hereditary graph classes
Logic
2023-06-22 v4 Combinatorics
Abstract
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.
Keywords
Cite
@article{arxiv.1903.11932,
title = {The undecidability of joint embedding and joint homomorphism for hereditary graph classes},
author = {Samuel Braunfeld},
journal= {arXiv preprint arXiv:1903.11932},
year = {2023}
}
Comments
17 pages; DMTCS version; initial version split