n (имя) существительное

показать все...

1. So that's all together exactly n edges.

2. So we suppose P of n.

3. E has successfully n minus 1 edges.

4. like, well, there are n minus 1 edges in any n vertex tree.

5. So we have n vertices.

6. It's a tree on n vertices.

7. on n.

8. every such tree has n edges.

9. has n minus 1 edges.

10. We know that's a tree on n vertices has n minus 1 edges.

11. So a tree with n vertices has n minus 1 edges.

показать все...