RUS
ENG
Full version
JOURNALS
// Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia
// Archive
Dokl. RAN. Math. Inf. Proc. Upr.,
2023
Volume 509,
Pages
46–49
(Mi danma359)
MATHEMATICS
Weakly saturated subgraphs of random graphs
O. I. Kalinichenko
a
,
B. Tayfeh-Rezaie
b
,
M. E. Zhukovskii
a
a
Moscow Institute of Physics and Technology, Laboratory of Combinatorial and Geometric Structures, Moscow, Russia
b
School of Mathematics, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran
Abstract:
In this paper, we study weak saturation numbers of binomial random graphs. We proved stability of the weak saturation for several pattern graphs, and proved asymptotic stability for all pattern graphs.
Keywords:
random graph, weak saturation, bootstrap percolation.
UDC:
519.175.4
Presented:
V. V. Kozlov
Received: 28.11.2022
Revised: 11.12.2022
Accepted: 21.12.2022
DOI:
10.31857/S268695432370008X
References
English version:
Doklady Mathematics, 2023,
107
:1,
37–39
Bibliographic databases:
©
Steklov Math. Inst. of RAS
, 2024
References
