On the number of homogeneous subgraphs of a graph (Q759767)

A graph is said to be homogeneous if its edge set is empty or complete (contains all possible edges). G(n) is defined to be the maximum number m such that every graph on n vertices contains at least m homogeneous, vertex induced, subgraphs. The main result of this paper is the pair of inequalities: \(\exp ((0.7214)\log^ 2(n))\geq G(n)\geq \exp ((0.2275)\log^ 2(n))\). The author also proves several related results and discusses several conjectures.