BipartiteEdgeDeletionNumber on LabeledGraph
The fewest edges whose deletion leaves a bipartite graph.
FindStat's St001572: the edges that fall inside the sides of the best division. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "BipartiteEdgeDeletionNumber"). 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 St001572
The minimal number of edges to remove to make a graph bipartite.
| Object | Value |
|---|---|
([],1) | 0 |
([],2) | 0 |
([],3) | 0 |
([],4) | 0 |
([],5) | 0 |
([],6) | 0 |
([(0,1)],2) | 0 |
([(1,2)],3) | 0 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001572 has the rest.