Mujin Choi

collaborators

5 papers

math.CO2026

Tree-independence number of $K_{1, d}$ -free graph classes

Kenny Bešter Štorgel, Mujin Choi, Hidde Koerts +1

In this paper, we investigate the tree-independence number of graph classes that do not contain $K_{1, d}$ as an induced subgraph. Dallard et al. conjectured that for any positive i…

cs.DS2026

Branch-width of represented matroids in matrix multiplication time

Mujin Choi, Tuukka Korhonen, Sang-il Oum

For an $n$ -element matroid $M$ given by an $n \times n$ matrix representation over a finite field $F$ and an integer $k$ , we present an algorithm with running time $O_{k,\m…

math.CO2025

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes

Mujin Choi, Maximilian Gorsky, Gunwoo Kim +2

We introduce the tree-decomposition-based graph parameter Odd-Cycle-Packing-treewidth (OCP-tw) as a width parameter that asks to decompose a given graph into pieces of bounded odd…

math.CO2025

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars

Mujin Choi, Sebastian Wiederrecht

A $k$ -ladder is the graph obtained from two disjoint paths, each with $k$ vertices, by joining the $i$ th vertices of both paths with an edge for each $i \in {1, \dots, k}$ . In this…

math.CO2025

Excluding an induced wheel minor in graphs without large induced stars

Mujin Choi, Claire Hilaire, Martin Milanič +1

We study a conjecture due to Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht stating that for any positive integer $d$ and any planar graph $H$ , the class of all $K_…

Tree-independence number of K1,d​-free graph classes

Branch-width of represented matroids in matrix multiplication time

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars

Excluding an induced wheel minor in graphs without large induced stars

Tree-independence number of $K_{1, d}$ -free graph classes