dijoin和blow-up有向图的反转数
The inversion number of dijoins and blow-up digraphs
AI总结:
本文研究有向图的反转数,证明了关于dijoin的结论从而推翻了两个猜想,并利用blow-up图构造了反转数为$n/3+1$的竞赛图。
摘要:
对于有向图$D$,$X \subseteq V(D)$在$D$中的$inversion$是通过反转$D$中两端均在$X$内的所有弧的方向而得到的有向图。$D$的反转数记为$inv(D)$,是将$D$转化为无环有向图所需的最小反转次数。本文首先证明,对于任意反转数$inv(D)$为偶数的有向图$D$,$inv(\overrightarrow{C_3} \Rightarrow D) = inv(D) + 1$,其中dijoin $\overrightarrow{C_3} \Rightarrow D$是由$\overrightarrow{C_3}$和$D$的不相交并集添加从$\overrightarrow{C_3}$到$D$的所有弧得到的有向图。由此我们推翻了Aubian等人和Alon等人的猜想。我们还研究了blow-up图,即将竞赛图的所有顶点替换为有向图得到的有向图。我们利用blow-up图构造了一个阶为$n$且$inv(T)=\frac{n}{3}+1$的竞赛图$T$。
英文摘要:
For an oriented graph $D$, the $inversion$ of $X \subseteq V(D)$ in $D$ is the digraph obtained from $D$ by reversing the direction of all arcs with both ends in $X$. The inversion number of $D$, denoted by $inv(D)$, is the minimum number of inversions needed to transform $D$ into an acyclic digraph. In this paper, we first show that $inv (\overrightarrow{C_3} \Rightarrow D)= inv(D) +1$ for any oriented graph $\textit{D}$ with even inversion number $inv(D)$, where the dijoin $\overrightarrow{C_3} \Rightarrow D$ is the oriented graph obtained from the disjoint union of $\overrightarrow{C_3}$ and $D$ by adding all arcs from $\overrightarrow{C_3}$ to $D$. Thus we disprove the conjecture of Aubian el at. \cite{2212.09188} and the conjecture of Alon el at. \cite{2212.11969}. We also study the blow-up graph which is an oriented graph obtained from a tournament by replacing all vertices into oriented graphs. We construct a tournament $T$ with order $n$ and $inv(T)=\frac{n}{3}+1$ using blow-up graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。