MaximumCutSize on LabeledGraph
The most edges between the two sides of a division of the vertices.
FindStat's St001869. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "MaximumCutSize"). 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 St001869
The maximum cut size of a graph.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([(0,1)],2) | 1 |
([(1,2)],3) | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001869 has the rest.