Increasing spanning forests in graphs and simplicial complexes

Joshua Hallam, Jeremy L. Martin, Bruce E. Sagan

Let G be a graph with vertex set {1,...,n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F form an incre…