Jungho Ahn

activity

20192026

most citedBounds for the Twin-width of Graphs

15 citations · 28 across the 8 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

math.CO2026

An Erdős-Pósa theorem for induced packings of even cycles

Jungho Ahn, Lars Jaffke, O-joung Kwon +2

We show that for every graph $G$ and every positive integer $k$ , $G$ contains either $k$ vertex-disjoint even cycles with no edges between distinct cycles, or a set of $O(k^2\log k…

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.CO2026

Optimal b-Colourings and Fall Colourings in $H$ -Free Graphs

Jungho Ahn, Tala Eagling-Vose, Felicia Lucke +3

In a colouring of a graph, a vertex is b-chromatic if it is adjacent to a vertex of every other colour. We consider four well-studied colouring problems: b-Chromatic Number, Tight…

An Erdős-Pósa theorem for induced packings of even cycles

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

Optimal b-Colourings and Fall Colourings in H-Free Graphs

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

Optimal b-Colourings and Fall Colourings in $H$ -Free Graphs