Boram Park

activity

20242026

collaborators

Showing 2026 · math.COShow all

2 papers · 2 filters

math.CO2026

Connectivity keeping paths in digraphs

Hojin Chu, Boram Park, Homoon Ryu

Mader conjectured that every $k$ -strong digraph $D$ with minimum semidegree $δ^{0} (D) \geq 2 k + m - 1$ contains a dipath $P$ of order $m$ such that $D - V (P)$ remains $k$ -strong. For $k = 1$ ,…

math.CO2026

Minimum degree conditions for removable matchings in $k$ -connected graphs

Hojin Chu, Ringi Kim, Boram Park

In 1969, Halin proved that every $k$ -connected graph $G$ with minimum degree at least $k + 1$ contains an edge $e$ such that $G - e$ is $k$ -connected. As an edge is a matching of size…

Connectivity keeping paths in digraphs

Minimum degree conditions for removable matchings in k-connected graphs

Minimum degree conditions for removable matchings in $k$ -connected graphs