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 ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback