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