Algebraic Characterizations for Minors of Finite Graphs via Flow Transformation Monoid Division and Embedding

Amena Assem, Hanna Derets, Chrystopher L. Nehaniv

We prove three theorems on the flow monoids of finite graphs. First, we show that a non-empty finite graph G = (V, E) is connected if and only if its flow monoid contains a constan…