On the logical complexity of convex polygon dissections
Publikation: Vorabdruck/Dokumentation/Bericht › Vorabdruck (Preprint)
Beitragende
Abstract
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$.
Details
Originalsprache | Undefiniert |
---|---|
Publikationsstatus | Veröffentlicht - 21 Juli 2006 |
Extern publiziert | Ja |
No renderer: customAssociatesEventsRenderPortal,dk.atira.pure.api.shared.model.researchoutput.WorkingPaper
Externe IDs
ORCID | /0000-0001-8228-3611/work/142659291 |
---|
Schlagworte
Schlagwörter
- math.CO, math.LO