TuranEdgeExcess on LabeledGraph
The edges less those of the complement of the Turán graph with as many parts as the independence number: disjoint cliques as equal in size as possible.
FindStat's St001798, nonnegative by Turán's theorem. The independence number is the number of cliques; n mod it of them have one more vertex than the rest. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "TuranEdgeExcess"). The head's page has its examples.
Live
Distribution
Over LabeledGraphs at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001798
The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([],7) | 0 |
([(0,1)],2) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001798 has the rest.