当前位置:
X-MOL 学术
›
Discret. Optim.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Small 1-defective Ramsey numbers in perfect graphs
Discrete Optimization ( IF 0.9 ) Pub Date : 2019-06-18 , DOI: 10.1016/j.disopt.2019.06.001 Tınaz Ekim , John Gimbel , Oylum Şeker
中文翻译:
完美图中的小1缺陷Ramsey数
更新日期:2019-06-18
Discrete Optimization ( IF 0.9 ) Pub Date : 2019-06-18 , DOI: 10.1016/j.disopt.2019.06.001 Tınaz Ekim , John Gimbel , Oylum Şeker
In this paper, we initiate the study of defective Ramsey numbers for the class of perfect graphs. Let be the class of all perfect graphs and denote the smallest such that all perfect graphs on vertices have either a 1-dense -set or a 1-sparse -set. We show that for any , , , , , and . We exhibit all extremal graphs for (there are exactly three). We also obtain the 1-defective Ramsey number of order (4,7) in triangle-free perfect graphs, namely .
中文翻译:
完美图中的小1缺陷Ramsey数
在本文中,我们开始研究一类完善的图的有缺陷的Ramsey数。让 成为所有完美图的一类, 表示最小 这样所有的完美图 顶点具有1密度 集或1-稀疏 -组。我们证明 对于任何 , , , , , 和 。我们展示了所有的极值图(正好有三个)。我们还获得了无三角形完美图中1阶次的有缺陷Ramsey数(4,7),即。