Given a graph, we can form a spanning forest by first sorting the edges in a random
order, and then only keeping edges incident to a vertex which is not incident to any
previous edge. The resulting forest is dependent on the ordering of the edges, and so
we can ask, for example, how likely is it for the process to produce a graph with
trees.
We look at all graphs which can produce at most two trees in this process and
determine the probabilities of having either one or two trees. From this we construct
infinite families of graphs which are nonisomorphic but produce the same
probabilities.
PDF Access Denied
We have not been able to recognize your IP address
18.221.129.145
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.