3 papers
cs.DM2026
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…
math.CO2025
Edge-disjoint linkage in infinite graphs
Amena Assem, R. Bruce Richter
In 1980, Thomassen stated his weak linkage conjecture: for an odd positive integer k, if a graph G is k-edge-connected, then, for any collection of k pairs of vertices {s_1,t_1}, .…
math.CO2023
The Nash-Williams orientation theorem for graphs with countably many ends
Amena Assem, Marcel Koloschin, Max Pitz
Nash-Williams proved in 1960 that a finite graph admits a -arc-connected orientation if and only if it is -edge-connected, and conjectured that the same result should hold f…