On the logical complexity of convex polygon dissections

Simple item page
dc.creatorBodirsky, Manuel
dc.creatorKang, Mihyun
dc.creatorVerbitsky, Oleg
dc.date2006-07-21
dc.date.accessioned2026-07-07T07:20:46Z
dc.date.available2026-07-07T07:20:46Z
dc.descriptionThe 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$.
dc.description26 pages
dc.identifierhttps://arxiv.org/abs/math/0607531
dc.identifierhttp://arxiv.org/abs/math/0607531
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/115070
dc.subjectCombinatorics
dc.subjectLogic
dc.titleOn the logical complexity of convex polygon dissections
dc.typetext

Files

Collections

arXiv