次无向纠缠下的闭包
Closure Under Minors of Undirected Entanglement
摘要:
纠缠度是一种有向图的复杂性度量,起源于不动点理论。它的目的是计算有向图中圈的嵌套深度。本文证明了对于任意固定的$k \in \mathbb{N}$,纠缠度至多为$k$的无向图类在取子式下是闭的。我们的证明依赖于纠缠的Robber和Cops游戏的博弈论表征。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。