Breadth on OrderedTree
The most vertices at any one depth.
The largest number of nodes on one level, called breadth to keep width for posets.
Called as CombinatorialStat(x, "Breadth"). The head's page has its examples.
Live
Distribution
Over OrderedTrees at each size, tallied here in your browser; sizes past 6 are not offered.
FindStat St001058
The breadth of the ordered tree.
| Object | Value |
|---|---|
[[]] | 1 |
[[[]]] | 1 |
[[],[]] | 2 |
[[[[]]]] | 1 |
[[[],[]]] | 2 |
[[[]],[]] | 2 |
[[],[[]]] | 2 |
[[[[[]]]]] | 1 |
Data from FindStat, the combinatorial statistic finder; the page at findstat.org/St001058 has the rest.