The number of minimally connected block designs (Q1082758)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of minimally connected block designs |
scientific article; zbMATH DE number 3974112
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The number of minimally connected block designs |
scientific article; zbMATH DE number 3974112 |
Statements
The number of minimally connected block designs (English)
0 references
1986
0 references
The formula \(a^{b-1} b^{a-1}\) is derived for the number of connected \(a\times b\) block designs having the least possible number, \(a+b-1\), of observations needed for connectedness. It is shown that this formula also arises as the number of labeled bicolored trees with a vertices of one color and b vertices of the other.
0 references
minimally connected block designs
0 references
labeled bicolored trees
0 references
