arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2212.11969math.COcs.DM
收藏

有向图与竞赛图的可逆性

Invertibility of digraphs and tournaments

Noga Alon, Emil Powierski, Michael Savery, Alex Scott, Elizabeth Wilmer

AI总结:

本文研究有向图反转数,给出竞赛图判定的二次紧时间算法与一般有向图的 NP 完全性证明,并解决相关猜想及 $n$ 顶点竞赛图最大反转数的渐近极值问题。

摘要:

对于有向图 $D$ 和集合 $X\subseteq V(D)$,$X$ 在 $D$ 中的反转是指将 $D$ 中两端点均位于 $X$ 内的边的方向全部反转后得到的有向图。$D$ 的反转数 $\textrm{inv}(D)$ 是依次对 $D$ 施加反转以产生无环有向图所需的最少反转次数。针对 Bang-Jensen、da Silva 和 Havet 最近提出的问题,我们证明:对于每个 $k\in\mathbb{N}$ 和竞赛图 $T$,判定 $\textrm{inv}(T)\leq k$ 是否成立的问题可在 $O_k(|V(T)|^2)$ 时间内解决,且该复杂度对所有 $k$ 都是紧的。特别地,当以 $k$ 为参数时,该问题是固定参数可处理的。另一方面,我们在他们工作的基础上证明了其猜想:对于 $k\geq 1$,判定一般有向图 $D$ 是否满足 $\textrm{inv}(D)\leq k$ 的问题是 NP 完全的。我们还构造了反转数等于其圈横截数两倍的有向图,证实了 Bang-Jensen、da Silva 和 Havet 的另一个猜想;同时,我们针对他们关于所谓“dijoin”有向图反转数的猜想给出了反例,并证明该猜想在某些情形下成立。最后,我们渐近解决了此设定下自然的极值问题,改进了 Belkhechine、Bouaziz、Boudabbous 和 Pouzet 此前的界,证明 $n$ 顶点竞赛图的最大反转数为 $(1+o(1))n$。

英文摘要:

For an oriented graph $D$ and a set $X\subseteq V(D)$, the inversion of $X$ in $D$ is the digraph obtained by reversing the orientations of the edges of $D$ with both endpoints in $X$. The inversion number of $D$, $\textrm{inv}(D)$, is the minimum number of inversions which can be applied in turn to $D$ to produce an acyclic digraph. Answering a recent question of Bang-Jensen, da Silva, and Havet we show that, for each $k\in\mathbb{N}$ and tournament $T$, the problem of deciding whether $\textrm{inv}(T)\leq k$ is solvable in time $O_k(|V(T)|^2)$, which is tight for all $k$. In particular, the problem is fixed-parameter tractable when parameterised by $k$. On the other hand, we build on their work to prove their conjecture that for $k\geq 1$ the problem of deciding whether a general oriented graph $D$ has $\textrm{inv}(D)\leq k$ is NP-complete. We also construct oriented graphs with inversion number equal to twice their cycle transversal number, confirming another conjecture of Bang-Jensen, da Silva, and Havet, and we provide a counterexample to their conjecture concerning the inversion number of so-called 'dijoin' digraphs while proving that it holds in certain cases. Finally, we asymptotically solve the natural extremal question in this setting, improving on previous bounds of Belkhechine, Bouaziz, Boudabbous, and Pouzet to show that the maximum inversion number of an $n$-vertex tournament is $(1+o(1))n$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑