Trees · Cayley's Formula

Lesson 10

Nikolai Chukhin · Alexander S. Kulikov

Problem. Consider trees built on the set of vertices \([7]\) in which vertices \(2\) and \(3\) have degrees \(3\), vertex \(5\) has degree \(2\), and other vertices have degree \(1\). Find the number of such trees.

1 point