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
来源：
ARS COMBINATORIA | 2004年 / 73卷
关键词：
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 条
[31]   Clique-Coloring Claw-Free Graphs [J].
Zuosong Liang ;
Erfang Shan ;
Liying Kang .
Graphs and Combinatorics, 2016, 32 :1473-1488
[32]   Coordinated graphs and clique graphs of clique-Helly perfect graphs [J].
Bonomo, Flavia ;
Duran, Guillermo ;
Groshaus, Marina .
UTILITAS MATHEMATICA, 2007, 72 :175-191
[33]   Clique-Coloring Claw-Free Graphs [J].
Liang, Zuosong ;
Shan, Erfang ;
Kang, Liying .
GRAPHS AND COMBINATORICS, 2016, 32 (04) :1473-1488
[34]   Minimum Clique-Free Subgraphs of Kneser Graphs [J].
Vahrushev, S. V. ;
Zhukovskii, M. E. ;
Kiselev, S. G. ;
Skorkin, A. Yu .
DOKLADY MATHEMATICS, 2020, 102 (03) :472-473
[35]   Edge clique cover of claw-free graphs [J].
Javadi, Ramin ;
Hajebi, Sepehr .
JOURNAL OF GRAPH THEORY, 2019, 90 (03) :311-405
[36]   Minimum Clique-Free Subgraphs of Kneser Graphs [J].
S. V. Vahrushev ;
M. E. Zhukovskii ;
S. G. Kiselev ;
A. Yu. Skorkin .
Doklady Mathematics, 2020, 102 :472-473
[37]   Extremal Theta-free planar graphs [J].
Lan, Yongxin ;
Shi, Yongtang ;
Song, Zi-Xia .
DISCRETE MATHEMATICS, 2019, 342 (12)
[38]   Extremal H-free planar graphs [J].
Lan, Yongxin ;
Shi, Yongtang ;
Song, Zi-Xia .
ELECTRONIC JOURNAL OF COMBINATORICS, 2019, 26 (02)
[39]   RESTRICTED GREEDY CLIQUE DECOMPOSITIONS AND GREEDY CLIQUE DECOMPOSITIONS OF K(4)-FREE GRAPHS [J].
MCGUINNESS, S .
COMBINATORICA, 1994, 14 (03) :321-334
[40]   AN EXTREMAL PROBLEM ON KR-FREE GRAPHS [J].
FRANKL, P ;
PACH, J .
JOURNAL OF GRAPH THEORY, 1988, 12 (04) :519-523
12345