Youngho Yoo

collaborators

4 papers

math.CO2025

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers

Steffen Borgwardt, ZdenÄk DvoÅÃ¡k, Bryce Frederickson +2

The assignments of a set of $m$ items into $n$ clusters of prescribed sizes $k_{1}, \dots, k_{n}$ can be encoded as the vertices of the partition polytope $PP (k_{1}, \dots, k_{n})$ . W…

math.CO2025

A unified ErdÅs-PÃ³sa theorem for cycles in graphs labelled by multiple abelian groups

J. Pascal Gollin, Kevin Hendrey, O-joung Kwon +2

In 1965, ErdÅs and PÃ³sa proved that there is an (approximate) duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all cycles. Suc…

math.CO2024

Packing $A$ -paths of length zero modulo a prime

Robin Thomas, Youngho Yoo

It is known that $A$ -paths of length $0$ mod $m$ satisfy the ErdÅs-PÃ³sa property if $m = 2$ or $m = 4$ , but not if $m > 4$ is composite. We show that if $p$ is prime, then $A$ -paths…

math.CO2024

Packing cycles in undirected group-labelled graphs

Robin Thomas, Youngho Yoo

We prove a refinement of the flat wall theorem of Robertson and Seymour to undirected group-labelled graphs $(G, I^^{3})$ where $I^^{3}$ assigns to each edge of an undirected graph $G$ an e…

Improved Decomposition Bounds for Partition Polytopes and Odd-Covers

A unified ErdÅs-PÃ³sa theorem for cycles in graphs labelled by multiple abelian groups

Packing A-paths of length zero modulo a prime

Packing cycles in undirected group-labelled graphs

A unified ErdÅs-PÃ³sa theorem for cycles in graphs labelled by multiple abelian groups

Packing $A$ -paths of length zero modulo a prime