A. M. Raigorodskii, “Asymptotics of the independence number of a random subgraph of the graph <nobr>$G(n,r,{<}s)$</nobr>”, Itogi Nauki i Tekhniki. Sovrem. Mat. Pril. Temat. Obz., 2022, Volume 205,Pages <nobr>16

Asymptotics of the independence number of a random subgraph of the graph $G(n,r,{<}s)$

A. M. Raigorodskii^abcd

^a Lomonosov Moscow State University
^b Moscow Institute of Physics and Technology (National Research University), Dolgoprudny, Moscow Region
^c Caucasus Mathematical Center, Adyghe State University, Maikop
^d Buryat State University, Institute for Mathematics and Informatics, Ulan-Ude

Abstract: In this paper, we discuss the probabilistic version of the classical problem of extremal combinatorics stated appeared in the middle of the 20th century by P. Erdős, C. Ko, and R. Rado.

Keywords: random graph, extremal system of sets, hypergraph.

UDC: 519.17

MSC: 05C80

DOI: 10.36535/0233-6723-2022-205-16-21