Cayley's Formula

preview_player
Показать описание
A short video about an elegant proof of the number of spanning trees of a complete graph.

------------------

Timetable:
0:00 - Introduction
0:13 - Definitions
0:34 - Statement
1:03 - Proof
3:37 - Outro

------------------

Source code:

Music:

Software used:

Social media:

------------------

[CZ] My notes on Martin Koutecký's Combinatorics and Graphs 1 lecture:
Рекомендации по теме
Комментарии
Автор

Great and elegant proof by counting povykosy. Good job

SimsHacks
Автор

Just a little comment for the algorithm, great work !

pacificll
Автор

IMHO top-3 things in CS:
* Data structures
* Graph algorithm's
* Number theory

TheSkeef
Автор

Great stuff! What software do you use to make the visuals?

beardyman
Автор

how did u get the production formula
from n * (n-k-1) ?

amedeozappulla
Автор

Nice explanation. But @1:27 the left figure has 7 vertices while the right one has 6. Why?

ersidget
Автор

nice channel! are you more focused on the CS or the math aspect of graphs? there are many interesting algorithms in CS graph theory that would be better explained with your animations!!

tanchienhao