An Estimation Curve for the Log-Complexity of Graphs

We attempt to produce estimates for the log-complexity of graphs of given order and size. To gain high precision, we use the fact that the values of log-complexity are known for many special values of the graph size. Of primary interest are the values of the maximal log-complexity. As we saw, the basic fit is logarithmic, but there are some wavy effects due to discreteness that we are trying to model in.