Theorem (Cayley-K3 canonical): K_3 (complete graph on 3 vertices, the triangle) has exactly 3 spanning trees - the 3 paths obtained by removing one of the 3 edges. Cayley's formula T_n = n^{n-2} (Cayley 1889 Quart J Math 23, 376) gives T_3…
Theorem (Cayley-K3 canonical): K_3 (complete graph on 3 vertices, the triangle) has exactly 3 spanning trees - the 3 paths obtained by removing one of the 3 edges. Cayley's formula T_n = n^{n-2} (Cayley 1889 Quart J Math 23, 376) gives T_3…