共 50 条
Minor clique free extremal graphs
被引:0
作者:
Cera, M
[1
]
Diánez, A
García-Vázquez, P
Valenzuela, JC
机构:
[1] Univ Seville, EUIT Agricola, Seville, Spain
[2] Univ Seville, ETS Arquitectura, Seville, Spain
[3] Univ Cadiz, EPS Algeciras, Cadiz, Spain
来源:
关键词:
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
In this note, we prove that the largest non contractible to K-P graph of order n with [2n + 3/3] less than or equal to p less than or equal to n, is the Turin's graph T2p-n-1(n). Furthermore, a new upperbound for this problem is determined.
引用
收藏
页码:153 / 162
页数:10
相关论文
共 50 条