关于凸多边形剖分的逻辑复杂性
On the logical complexity of convex polygon dissections
摘要：
图$G$的逻辑深度是定义$G$直到在邻接和相等关系的语言中同构的一阶句子的最小量词深度。我们考虑$G$是一个剖分的凸多边形，或等价地，一个双连通外平面图的情况。我们从上面通过$G$的对偶树的组合参数的函数来约束这样的$G$的逻辑深度。
英文摘要：
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 relations. We consider the case that $G$ is a dissection of a convex polygon or, equivalently, a biconnected outerplanar graph. We bound the logical depth of a such $G$ from above by a function of combinatorial parameters of the dual tree of $G$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
