@inbook{fb5142d3247149fe83fea7fe90b0cea0,

title = "Uniform Spanning Trees of Planar Graphs",

abstract = "Let G be a finite connected graph. A spanning tree T of G is a connected subgraph of G that contains no cycles and such that every vertex of G is incident to at least one edge of T. The set of spanning trees of a given finite connected graph is obviously finite and hence we may draw one uniformly at random. This random tree is called the uniform spanning tree (UST) of G. This model was first studied by Kirchhoff who gave a formula for the number of spanning trees of a given graph and provided a beautiful connection with the theory of electric networks. In particular, he showed that the probability that a given edge {x, y} of G is contained in the UST equals ℛeff(x↔ y; G); we prove this fundamental formula in Sect. 7.2 (see Theorem 7.2).",

author = "Asaf Nachmias",

note = "Publisher Copyright: {\textcopyright} 2020, The Author(s).",

year = "2020",

doi = "10.1007/978-3-030-27968-4_7",

language = "אנגלית",

series = "Lecture Notes in Mathematics",

publisher = "Springer Verlag",

pages = "89--103",

booktitle = "Lecture Notes in Mathematics",

}