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

关于图的亏数的进一步结果

Further results on the deficiency of graphs

Petros A. Petrosyan, Hrant H. Khachatrian

摘要:

图$G$的\emph{proper $t$-edge-coloring}是映射$α: E(G)\rightarrow \{1,\ldots,t\}$,使得使用所有颜色,并且对于每对相邻边$e,e^{\prime}\in E(G)$为$α(e)\neq α(e^{\prime})$。若$α$是图$G$和$v\in V(G)$的一个真边染色,则\emph{the spectrum of a vertex $v$},记作$S\left(v,α\right)$,是与$v$关联的边上出现的所有颜色的集合.用$def(v,α)$表示的\emph{The deficiency of $α$ at vertex $v\in V(G)$}是必须加到$S\left(v,α\right)$上以形成一个区间的最小整数数,而\emph{the deficiency $def\left(G,α\right)$ of a proper edge-coloring $α$ of $G$}定义为和$\sum_{v\in V(G)}def(v,α)$。\emph{The deficiency of a graph $G$},用$def(G)$表示,定义如下:$def(G)=\min_αdef\left(G,α\right)$,其中在$G$的所有可能的正确边着色上取最小值。对于一个图$G$,它有一个适当的$t$ -边染色$α$,其亏$def(G,α)=def(G)$的$t$的最小和最大值分别表示为$w_{def}(G)$和$W_{def}(G)$。本文给出了$w_{def}(G)$和$W_{def}(G)$的一些界。特别是,我们表明,对于任何$l\in \mathbb{N}$,存在一个图$G$,使$def(G)>0$和$W_{def}(G)-w_{def}(G)\geq l$。已知对于完全图$K_{2n+1}$,$def(K_{2n+1})=n$($n\in \mathbb{N}$)。最近,Borowiecka-Olszewska,Drgas-Burchardt和Hauszczak对近完全图的亏数提出了如下猜想:如果$n\in \mathbb{N}$,则$def(K_{2n+1}-e)=n-1$ .在本文中,我们证实了这个猜想。

英文摘要:

A \emph{proper $t$-edge-coloring} of a graph $G$ is a mapping $α: E(G)\rightarrow \{1,\ldots,t\}$ such that all colors are used, and $α(e)\neq α(e^{\prime})$ for every pair of adjacent edges $e,e^{\prime}\in E(G)$. If $α$ is a proper edge-coloring of a graph $G$ and $v\in V(G)$, then \emph{the spectrum of a vertex $v$}, denoted by $S\left(v,α\right)$, is the set of all colors appearing on edges incident to $v$. \emph{The deficiency of $α$ at vertex $v\in V(G)$}, denoted by $def(v,α)$, is the minimum number of integers which must be added to $S\left(v,α\right)$ to form an interval, and \emph{the deficiency $def\left(G,α\right)$ of a proper edge-coloring $α$ of $G$} is defined as the sum $\sum_{v\in V(G)}def(v,α)$. \emph{The deficiency of a graph $G$}, denoted by $def(G)$, is defined as follows: $def(G)=\min_αdef\left(G,α\right)$, where minimum is taken over all possible proper edge-colorings of $G$. For a graph $G$, the smallest and the largest values of $t$ for which it has a proper $t$-edge-coloring $α$ with deficiency $def(G,α)=def(G)$ are denoted by $w_{def}(G)$ and $W_{def}(G)$, respectively. In this paper, we obtain some bounds on $w_{def}(G)$ and $W_{def}(G)$. In particular, we show that for any $l\in \mathbb{N}$, there exists a graph $G$ such that $def(G)>0$ and $W_{def}(G)-w_{def}(G)\geq l$. It is known that for the complete graph $K_{2n+1}$, $def(K_{2n+1})=n$ ($n\in \mathbb{N}$). Recently, Borowiecka-Olszewska, Drgas-Burchardt and Hałuszczak posed the following conjecture on the deficiency of near-complete graphs: if $n\in \mathbb{N}$, then $def(K_{2n+1}-e)=n-1$. In this paper, we confirm this conjecture.

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

↑