Minimum Clique-Free Subgraphs of Kneser Graphs

被引：0

作者：

Vahrushev, S. V. ^{[1
]}

Zhukovskii, M. E. ^{[1
,2
,3
,4
]}

Kiselev, S. G. ^{[1
]}

Skorkin, A. Yu ^{[3
]}

机构：

[1] Natl Res Univ, Moscow Inst Phys & Technol, Dolgoprudnyi 141701, Moscow Oblast, Russia

[2] Russian Acad Sci, Sobolev Inst Math, Siberian Branch, Omsk 644043, Russia

[3] Adyghe State Univ, Caucasus Math Ctr, Maykop 385000, Republic Of Ady, Russia

[4] Russian Presidential Acad Natl Econ & Publ Adm, Moscow 119571, Russia

来源：

DOKLADY MATHEMATICS | 2020年 / 102卷 / 03期

关键词：

Kneser graphs; saturation number; weak saturation number; SATURATION;

D O I：

10.1134/S1064562420060204

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

The saturation and weak saturation numbers of Kneser graphs with clique patterns are estimated.

引用

页码：472 / 473

页数：2

共 9 条

[1]

Bollobas B., 1967, Beitrage zur Graphentheorie, P25

[2] Weak saturation numbers of K2,t and Kp ∨ Kq [J].

Cui, Yajuan ;

Pu, Liqun .

AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2019, 16 (03) :237-240

[3] A PROBLEM IN GRAPH THEORY [J].

ERDOS, P ;

HAJNAL, A ;

MOON, JW .

AMERICAN MATHEMATICAL MONTHLY, 1964, 71 (10) :1107-&

[4] Ks,t-saturated bipartite graphs [J].

Gan, Wenying ;

Korandi, Daniel ;

Sudakov, Benny .

EUROPEAN JOURNAL OF COMBINATORICS, 2015, 45 :12-20

[5] Saturation in Random Graphs [J].

Korandi, Daniel ;

Sudakov, Benny .

RANDOM STRUCTURES & ALGORITHMS, 2017, 51 (01) :169-181

[6]

Lov��sz L, 1977, COMBINATORIAL SURVEY, P45

[7]

Martins T., 2020, ARXIV200401289

[8] Star saturation number of random graphs [J].

Mohammadian, A. ;

Tayfeh-Rezaie, B. .

DISCRETE MATHEMATICS, 2018, 341 (04) :1166-1170

[9] Exact bounds for some hypergraph saturation problems [J].

Moshkovitz, Guy ;

Shapira, Asaf .

JOURNAL OF COMBINATORIAL THEORY SERIES B, 2015, 111 :242-248

← 1 →