On the enumeration of labelled hypertrees and of labelled bipartite trees
classification
🧮 math.CO
keywords
labelledbipartitedegreesformulahypertreesprescribedtreesvertices
read the original abstract
We give a simple formula for the number of hypertrees with $k$ hyperedges of given sizes and $n+1$ labelled vertices with prescribed degrees. A slight generalization of this formula counts labelled bipartite trees with prescribed degrees in each class of vertices.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.