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

关于反演数的问题、证明和反证

Problems, proofs, and disproofs on the inversion number

Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhoefer, Nicolas Nisse, Clément Rambaud, Quentin Vermande

摘要:

有向图$D$中顶点集合$X$的{\it逆}在于反转$D\langle X\rangle$的所有弧的方向。有向图$D$的{\it反转数},记为${\rm inv}(D)$,是将$D$变换为无圈有向图所需的最小反转数。本文研究了有向图的反转数问题。首先给出了$n$阶有向图的最大反转数${\rm inv}(n)$的界。我们展示了$n - \mathcal{O}(\sqrt{n\log n}) \ \leq \ {\rm inv}(n) \ \leq \ n - \lceil \log (n+1) \rceil$。其次,我们反驳了Bang-Jensen等人的一个猜想,即对于每一对有向图$L$和$R$,我们都有${\rm inv}(L\Rightarrow R) ={\rm inv}(L) + {\rm inv}(R)$,其中$L\Rightarrow R$是由$L$和$R$的不交并通过将所有从$L$到$R$的弧相加而得到的有向图。最后,我们研究是否,对所有的正整数$k_1,k_2$,存在一个整数$f(k_1,k_2)$,使得如果$D$是一个有向图${\rm inv}(D) \geq f(k_1,k_2)$然后有一个分区$(V_1, V_2)$的$V(D)$,使${\rm inv}(D\langle V_i\rangle) \geq k_i$的$i=1,2$。我们证明了PDMATHBNF存在,并且对所有正整数PDMATHBNH都存在$f(1,k)\leq k+10$.进一步,我们证明了$f(k_1,k_2)$存在的所有对正整数$k_1,k_2$时,考虑的有向图被限制为比赛。

英文摘要:

The {\it inversion} of a set $X$ of vertices in a digraph $D$ consists in reversing the direction of all arcs of $D\langle X\rangle$. The {\it inversion number} of an oriented graph $D$, denoted by ${\rm inv}(D)$, is the minimum number of inversions needed to transform $D$ into an acyclic oriented graph. In this paper, we study a number of problems involving the inversion number of oriented graphs. Firstly, we give bounds on ${\rm inv}(n)$, the maximum of the inversion numbers of the oriented graphs of order $n$. We show $n - \mathcal{O}(\sqrt{n\log n}) \ \leq \ {\rm inv}(n) \ \leq \ n - \lceil \log (n+1) \rceil$. Secondly, we disprove a conjecture of Bang-Jensen et al. asserting that, for every pair of oriented graphs $L$ and $R$, we have ${\rm inv}(L\Rightarrow R) ={\rm inv}(L) + {\rm inv}(R)$, where $L\Rightarrow R$ is the oriented graph obtained from the disjoint union of $L$ and $R$ by adding all arcs from $L$ to $R$. Finally, we investigate whether, for all pairs of positive integers $k_1,k_2$, there exists an integer $f(k_1,k_2)$ such that if $D$ is an oriented graph with ${\rm inv}(D) \geq f(k_1,k_2)$ then there is a partition $(V_1, V_2)$ of $V(D)$ such that ${\rm inv}(D\langle V_i\rangle) \geq k_i$ for $i=1,2$. We show that $f(1,k)$ exists and $f(1,k)\leq k+10$ for all positive integers $k$. Further, we show that $f(k_1,k_2)$ exists for all pairs of positive integers $k_1,k_2$ when the oriented graphs in consideration are restricted to be tournaments.

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

↑