Geodesic
Minimum clique-free subgraphs of Kneser graphs
Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 495 (2020), pp. 31-33 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The saturation and weak saturation numbers of Kneser graphs with clique patterns are estimated.
Keywords: Kneser graphs, saturation number, weak saturation number. 
@article{DANMA_2020_495_a6,
     author = {S. V. Vakhrushev and M. E. Zhukovskii and S. G. Kiselev and A. Skorkin},
     title = {Minimum clique-free subgraphs of {Kneser} graphs},
     journal = {Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleni\^a},
     pages = {31--33},
     year = {2020},
     volume = {495},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DANMA_2020_495_a6/}
}
TY  - JOUR
AU  - S. V. Vakhrushev
AU  - M. E. Zhukovskii
AU  - S. G. Kiselev
AU  - A. Skorkin
TI  - Minimum clique-free subgraphs of Kneser graphs
JO  - Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
PY  - 2020
SP  - 31
EP  - 33
VL  - 495
UR  - http://geodesic.mathdoc.fr/item/DANMA_2020_495_a6/
LA  - ru
ID  - DANMA_2020_495_a6
ER  - 
%0 Journal Article
%A S. V. Vakhrushev
%A M. E. Zhukovskii
%A S. G. Kiselev
%A A. Skorkin
%T Minimum clique-free subgraphs of Kneser graphs
%J Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ
%D 2020
%P 31-33
%V 495
%U http://geodesic.mathdoc.fr/item/DANMA_2020_495_a6/
%G ru
%F DANMA_2020_495_a6
S. V. Vakhrushev; M. E. Zhukovskii; S. G. Kiselev; A. Skorkin. Minimum clique-free subgraphs of Kneser graphs. Doklady Rossijskoj akademii nauk. Matematika, informatika, processy upravleniâ, Tome 495 (2020), pp. 31-33. http://geodesic.mathdoc.fr/item/DANMA_2020_495_a6/

[1] Erdős P., Hajnal A., Moon J.W., “A problem in graph theory”, The American Mathematical Monthly, 71 (1964), 1107–1110 | DOI | MR | Zbl

[2] Bollobás B., “Weakly $k$-saturated graphs”, Beitrage zur Graphentheorie, Kolloquium (Manebach), 1967, 25–31 | MR

[3] Lovász L., “Flats in matroids and geometric graphs”, Combinatorial Surveys, Proc. 6th British Comb. Conf., Academic Press, 1977, 45–86 | MR

[4] Cui Y., Pu L., “Weak saturation numbers of $K_{2,t}$ and ${{K}_{p}} \cup {{K}_{q}}$”, AKCE International Journal of Graphs and Combinatorics, 16:3 (2019), 237–240 | DOI | MR | Zbl

[5] Gun W., Korándi D., Sudakov B., “$K_{s,t}$-saturated bipartite graphs”, European J. of Combinatorics, 45 (2015), 12–20 | DOI | MR

[6] Moshkovitz G., Shapira A., “Exact bounds for some hypergraph saturation problems”, J. combinatorial theory B, 111 (2015), 242–248 | DOI | MR | Zbl

[7] Korándi D., Sudakov B., “Saturation in random graphs”, Random structures and algorithms, 51:1 (2017), 169–181 | DOI | MR | Zbl

[8] Mohammadian A., Tayfeh-Rezaie B., “Star saturation number of random graphs”, Discrete Math., 341 (2018), 1166–1170 | DOI | MR | Zbl

[9] Kronenberg G., Martins T., Morrison N., Weak saturation numbers of complete bipartite graphs in the clique, 2020, arXiv: 2004.01289 | MR | Zbl