Seokbeom Kim

collaborators

3 papers

cs.DS2026

An FPT algorithm for cycle rank on semi-complete digraphs

Seokbeom Kim, O-joung Kwon, Myounghwan Lee

Cycle rank is a depth parameter for digraphs introduced by Eggan in 1963. Gruber (DMTCS 2012) and Giannopoulou, Hunter, and Thilikos (DAM 2012) asked whether the problem of determi…

math.CO2026

On a weaker notion of cross $t$ -intersecting families

Jiangdong Ai, Ming Chen, Seokbeom Kim +1

We prove that if two families $F \subseteq (k [ n ])$ and $F^{'} \subseteq (k ^{'} [ n ])$ satisfy $\sum_{1 \leq i, j \leq \ell} \lvert F_i \cap F_j' \rvert…

cs.DM2025

An efficient algorithm for $F$ -subgraph-free Edge Deletion on graphs having a product structure

Shinwoo An, Seonghyuk Im, Seokbeom Kim +1

Given a family $F$ of graphs, a graph is \emph{ $F$ -subgraph-free} if it has no subgraph isomorphic to a member of $F$ . We present a fixed-parameter li…

An FPT algorithm for cycle rank on semi-complete digraphs

On a weaker notion of cross t-intersecting families

An efficient algorithm for F-subgraph-free Edge Deletion on graphs having a product structure

On a weaker notion of cross $t$ -intersecting families

An efficient algorithm for $F$ -subgraph-free Edge Deletion on graphs having a product structure