#### Vol. 12, No. 4, 2019

 Recent Issues
 The Journal About the Journal Editorial Board Subscriptions Editors’ Interests Scientific Advantages Submission Guidelines Submission Form Ethics Statement Editorial Login ISSN: 1944-4184 (e-only) ISSN: 1944-4176 (print) Author Index Coming Soon Other MSP Journals
Graphs with at most two trees in a forest-building process

### Steve Butler, Misa Hamanaka and Marie Hardt

Vol. 12 (2019), No. 4, 659–670
DOI: 10.2140/involve.2019.12.659
##### Abstract

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 $k$ 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.

##### Keywords
forests, edge ordering, components, probability
Primary: 05C05