arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1409.5116math.CO
收藏

Ore度至多为7的4-临界图的刻划

Characterizing 4-Critical Graphs of Ore-Degree at most Seven

Luke Postle

摘要:

狄拉克引入了k-临界图的概念,即不是(k-1)-可着色的图,但其每个真子图都是(k-1)-可着色的。布鲁克定理指出,每个最大度为k的图都是k-可着色的,除非它包含一个同构于K_{k+1}的子图(或k = 2的奇圈)。等价地,对于所有k>= 4,唯一的最大度为k-1的k-临界图是K_k。布鲁克定理的一个自然推广是考虑图的Ore度,它是d(u)+d(v)在所有边uv上的最大值。Kierstead和Kostochka证明了对所有k>= 6,Ore度不超过2k-1的k-临界图只有K_k. Kostochka,Rabern和Steibitz证明了Ore度不超过9的5-临界图只有K_5和一个他们称之为O_5的图。Brook定理的另一个推广是Gallai关于k-临界图的最小密度的极限。最近,Kostochka和Yancey证明了Gallai猜想。他们对k>= 5的证明包含了上述关于Ore度的结果。然而,k = 4的情况仍然是开放的,这是本文的主题。Kostochka和Yancey对k = 4的情况的简短但漂亮的证明说,如果$G$是$4$-临界图,则|E(G)|>=(5| V(G)|-2)/3.我们证明了当存在一个大的三度独立集时,下面的界是更好的:如果G是4-临界图G,则|E(G)|>= 1.6| V(G)|+.2 α(D_3(G))-.6,其中D_3(G)是G的度3顶点诱导的图.作为推论,我们将Ore度不超过7的4-临界图精确地刻画为由K_4和Ore组成图族中Ore度为7的图。

英文摘要:

Dirac introduced the notion of a k-critical graph, a graph that is not (k-1)-colorable but whose every proper subgraph is (k-1)-colorable. Brook's Theorem states that every graph with maximum degree k is k-colorable unless it contains a subgraph isomorphic to K_{k+1} (or an odd cycle for k=2). Equivalently, for all k>=4, the only k-critical graph of maximum degree k-1 is K_k. A natural generalization of Brook's theorem is to consider the Ore-degree of a graph, which is the maximum of d(u)+d(v) over all edges uv. Kierstead and Kostochka proved that for all k>=6 the only k-critical graph with Ore-degree at most 2k-1 is K_k. Kostochka, Rabern and Steibitz proved that the only 5-critical graphs with Ore-degree at most 9 are K_5 and a graph they called O_5. A different generalization of Brook's theorem, motivated by Hajos' construction, is Gallai's conjectured bound on the minimum density of a k-critical graph. Recently, Kostochka and Yancey proved Gallai's conjecture. Their proof for k>=5 implies the above results on Ore-degree. However, the case for k=4 remains open, which is the subject of this paper. Kostochka and Yancey's short but beautiful proof for the case k=4 says that if $G$ is a $4$-critical graph, then |E(G)|>= (5|V(G)|-2)/3. We prove the following bound which is better when there exists a large independent set of degree three vertices: if G is a 4-critical graph G, then |E(G)|>= 1.6 |V(G)| + .2 alpha(D_3(G)) - .6, where D_3(G) is the graph induced by the degree three vertices of G. As a corollary, we characterize the 4-critical graphs with Ore-degree at most seven as precisely the graphs of Ore-degree seven in the family of graphs obtained from K_4 and Ore compositions.

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

↑