Let Fn;tr(n) consist of all simple graphs on n vertices and tr(n) edges, where tr(n) is the number of edges in the Turan's graph Tr(n) -- the complete r-partite graph on n vertices with partition sizes as equal as possible. ...