2000 character limit reached
When a forest, narrowed to an atom of subset algebra, turns out to be a tree
Published 31 Jan 2025 in math.CO | (2501.19068v3)
Abstract: It is proved that the restriction of a $k$ and $(k-1)$-component directed spanning forest of minimal weight to an atom of the subset algebra generated by the sets of vertices of trees of $k$-component minimal spanning forests is a tree. For spanning minimal forests consisting of fewer components, this property, generally speaking, does not exist.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.