Contractions to k8

Contractions to k8
复制标题

收缩到 k8

DOI:
--
复制
发表时间:
1994
影响因子:
0.9
通讯作者:
L. K. Jørgensen
L. K. Jørgensen
中科院分区:
数学3区
文献类型:
--
作者:
L. K. Jørgensen

文献摘要

被引文献

相似文献

证明了一个顶点数为n × 8的图中不收缩于K8的最大边数为6 n − 21,除非5整除n,并且只有一个顶点数为n = 5 m且大于6 n − 21的图不收缩于K8,这就是恰好有6 n − 20条边的K5(2)-cockades。
It is proved that the maximal number of edges in a graph with n ≧ 8 vertices that is not contractible to K8 is 6n − 21, unless 5 divides n, and the only graphs with n = 5m vertices and more than 6n − 21 edges that are not contractible to K8 are the K5(2)-cockades that have exactly 6n − 20 edges.