Closure Under Minors of Undirected Entanglement

Simple item page
dc.creatorBelkhir, Walid
dc.date2009-04-10
dc.date.accessioned2026-07-07T13:02:28Z
dc.date.available2026-07-07T13:02:28Z
dc.descriptionEntanglement is a digraph complexity measure that origins in fixed-point theory. Its purpose is to count the nested depth of cycles in digraphs. In this paper we prove that the class of undirected graphs of entanglement at most $k$, for arbitrary fixed $k \in \mathbb{N}$, is closed under taking minors. Our proof relies on the game theoretic characterization of entanglement in terms of Robber and Cops games.
dc.identifierhttps://arxiv.org/abs/0904.1703
dc.identifierhttp://arxiv.org/abs/0904.1703
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/226457
dc.subjectDiscrete Mathematics
dc.subjectComputer Science and Game Theory
dc.titleClosure Under Minors of Undirected Entanglement
dc.typetext

Files

Collections

arXiv