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 ...
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback