On the logical complexity of convex polygon dissections

Manuel Bodirsky, Mihyun Kang, Oleg Verbitsky

The logical depth of a graph $G$ is the minimum quantifier depth of a first order sentence defining $G$ up to isomorphism in the language of the adjacency and the equality relation…