特殊1类图和$(P_3; k)$ -余临界图的规模
On the size of special class 1 graphs and $(P_3; k)$-co-critical graphs
摘要:
Vizing的一个著名定理指出,如果$G$是一个具有最大度$Δ$的简单图,则$G$的色指数$χ'(G)$是$Δ$或$Δ+1$。图$G$是类1如果$χ'(G)=Δ$,和类2如果$χ'(G)=Δ+1$ ; $G$是$Δ$ -关键的,如果它是连接的,类2和$χ'(G-e)<χ'(G)$对于每个$e\in E(G)$。Vizing在1968年提出了一个长期存在的猜想,即$Δ$临界图在$n$顶点上至少有$(n(Δ-1)+ 3)/2$边.本文首先研究了一类图$G$的最小边数问题,并对每一个$e\in E(\overline{G})$确定了$χ'(G+e)=χ'(G)+1$.这样的图与$(P_3; k)$ -共-临界图有密切的关系,其中如果存在$E(G)$的$k$ -着色使得$G$不包含$P_3$的单色副本,但$E(G+e)$的每个$k$ -着色对于每个$e\in E(\overline{G})$都包含$P_3$的单色副本,则不完全图$G$是$(P_3; k)$-共-临界图.我们利用上述第一类图的大小的界来研究所有$(P_3; k)$ -co-临界图上的最小边数。证明了如果$G$是$n\ge k+2$顶点上的$(P_3; k)$ -余临界图,则有\[e(G)\ge {k \over 2}\left(n- \left\lceil {k \over 2} \right\rceil - \varepsilon\right) + {\lceil k/2 \rceil+\varepsilon \choose 2},\],其中$\varepsilon$是$n-\lceil k/2 \rceil $除以$2$的余数.该界限对于所有$k \ge 1$和$n \ge \left\lceil {3k /2} \right\rceil +2$都是最佳可能的。
英文摘要:
A well-known theorem of Vizing states that if $G$ is a simple graph with maximum degree $Δ$, then the chromatic index $χ'(G)$ of $G$ is $Δ$ or $Δ+1$. A graph $G$ is class 1 if $χ'(G)=Δ$, and class 2 if $χ'(G)=Δ+1$; $G$ is $Δ$-critical if it is connected, class 2 and $χ'(G-e)<χ'(G)$ for every $e\in E(G)$. A long-standing conjecture of Vizing from 1968 states that every $Δ$-critical graph on $n$ vertices has at least $(n(Δ-1)+ 3)/2$ edges. We initiate the study of determining the minimum number of edges of class 1 graphs $G$, in addition, $χ'(G+e)=χ'(G)+1$ for every $e\in E(\overline{G})$. Such graphs have intimate relation to $(P_3; k)$-co-critical graphs, where a non-complete graph $G$ is $(P_3; k)$-co-critical if there exists a $k$-coloring of $E(G)$ such that $G$ does not contain a monochromatic copy of $P_3$ but every $k$-coloring of $E(G+e)$ contains a monochromatic copy of $P_3$ for every $e\in E(\overline{G})$. We use the bound on the size of the aforementioned class 1 graphs to study the minimum number of edges over all $(P_3; k)$-co-critical graphs. We prove that if $G$ is a $(P_3; k)$-co-critical graph on $n\ge k+2$ vertices, then \[e(G)\ge {k \over 2}\left(n- \left\lceil {k \over 2} \right\rceil - \varepsilon\right) + {\lceil k/2 \rceil+\varepsilon \choose 2},\] where $\varepsilon$ is the remainder of $n-\lceil k/2 \rceil $ when divided by $2$. This bound is best possible for all $k \ge 1$ and $n \ge \left\lceil {3k /2} \right\rceil +2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。