Closure Under Minors of Undirected Entanglement

Details Closure Under Minors of Undirected Entanglement Closure Under Minors of Undirected Entanglement

2009-04-10

arxiv.org/abs/0904.1703v1

Computer Science

Discrete Mathematics

Scientific paper

Entanglement 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.

Affiliated with

Also associated with

No associations

Rating

Closure Under Minors of Undirected Entanglement does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Closure Under Minors of Undirected Entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Closure Under Minors of Undirected Entanglement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674074