Loading [MathJax]/extensions/TeX/mathchoice.js

Problem #56

Playing with Subgraphs

Find the number of distinct sub-graphs of a complete graph of n labelled vertices, such that the sub-graph is a spanning tree connecting all the vertices and the degree of no vertex is more than 3.

Given n equals 314159, give your answer \pmod{1\ 000\ 000\ 007}.

Contributed by Aman Kumar Kedia

Solved by 17 users

Log in to submit answers.

Is something wrong?

Maintaining a collection of high quality questions is our top priority. If, however, you do find an error, report the problem and we'll make sure it is reviewed soon.