LargestInducedForestSize on LabeledGraph
The most vertices that induce a graph with no cycle.
FindStat's St001321. The graph with no vertices gives 0.
Called as CombinatorialStat(x, "LargestInducedForestSize"). 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 St001321
The number of vertices of the largest induced subforest of a graph.
| Object | Value |
|---|---|
([],1) | 1 |
([],2) | 2 |
([],3) | 3 |
([],4) | 4 |
([],5) | 5 |
([],6) | 6 |
([],7) | 7 |
([(0,1)],2) | 2 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001321 has the rest.