Kirchhoff’s matrix-tree theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for ...
The enumeration of forests of different orders in a graph is carried out by a procedure that involves formal sums and certain annihilation operators on the space of such sums. The results here extend ...
One of the highlights in the Robertson-Seymour theory on graph minors is the finiteness (for each fixed surface S) of the set of the minimal forbidden minors for S. Theorem 7.0.1 (Robertson and ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback