Guoli Ding

collaborators

2 papers

math.CO2024

Unavoidable immersions of 4- and $f (t)$ -edge-connected graphs

Guoli Ding, Brittian Qualls

In this paper we prove that every sufficiently large 4-edge-connected graph contains the double cycle, $C_{2, r}$ , as an immersion. In proving this, we develop a new tool we call a…

math.CO2024

Integral Biflow Maximization

Guoli Ding, Rongchuan Tao, Mengxi Yang +1

Let $G = (V, E)$ be a graph with four distinguished vertices, two sources $s_{1}, s_{2}$ and two sinks $t_{1}, t_{2}$ , let $c : E \to Z_{+}$ be a capacity function, and let ${\c…

Unavoidable immersions of 4- and f(t)-edge-connected graphs

Integral Biflow Maximization

Unavoidable immersions of 4- and $f (t)$ -edge-connected graphs