On the joint embedding property for cographs and trees

Daniel Carter

A family of graphs $\mathcal{F}$ is said to have the joint embedding property (JEP) if for every $G_1,G_2\in \mathcal{F}$, there is an $H\in \mathcal{F}$ that contains both $G_1$…