O-joung Kwon

activity

20232026

collaborators

Showing math.COShow all

6 papers · 1 filter

math.CO2026

Erdős-Pósa property for induced packings of long $S$ -cycles

Jungho Ahn, O-joung Kwon

The Erdős-Pósa theorem states that for every integer $k \geq 1$ , every graph contains either $k$ vertex-disjoint cycles or a set of $O (k lo g k)$ vertices meeting all cycles…

math.CO2025

Unavoidable pivot-minors in graphs of large rank-depth

Jungho Ahn, Kevin Hendrey, O-joung Kwon +1

Shrub-depth and rank-depth are related graph parameters that are dense analogs of tree-depth. We prove that for every positive integer $t$ , every graph of sufficiently large rank-d…

math.CO2025

The Erdős-Pósa property for circle graphs as vertex-minors

Rutger Campbell, J. Pascal Gollin, Meike Hatzel +4

We prove that for any circle graph $H$ with at least one edge and for any positive integer $k$ , there exists an integer $t = t (k, H)$ so that every graph $G$ either has a vertex-minor…

math.CO2024

Erdős-Pósa property of $A$ -paths in unoriented group-labelled graphs

O-joung Kwon, Youngho Yoo

We characterize the obstructions to the Erdős-Pósa property of $A$ -paths in unoriented group-labelled graphs. As a result, we prove that for every finite abelian group $Γ$ and for…

math.CO2024

A coarse Erdős-Pósa theorem

Jungho Ahn, J. Pascal Gollin, Tony Huynh +1

An induced packing of cycles in a graph is a set of vertex-disjoint cycles with no edges between them. We generalise the classic Erdős-Pósa theorem to induced packings of cycles. M…

math.CO2023

Computing pivot-minors

Konrad K. Dabrowski, François Dross, Jisu Jeong +4

A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in…

Erdős-Pósa property for induced packings of long S-cycles