Until Razborov [1]} introduced the flag algebra method in 2007, little progress had been made toward the resolution of the inducibility problem. Since then, the problem has been closed for several small graphs [2]}, [3]}, [4]}. Fox, Huang and Lee [5]}, and separately Yuster [6]} resolved this problem for almost all graphs by considering \(G_{n,p}\)  for arbitrary fixed \(p\)  as \(n \rightarrow \infty \) . Here, \(G_{n,p}\)  is a vector of \(\binom{n}{2}\)  Bernoulli(\(p\) ) random variables, each determining the presence or absence of an edge in an \(n\) -vertex graph. In order to fully express their result, we also need the following definition.
