Loading Events

« All Events

  • This event has passed.
:

Jungho Ahn (안정호), Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

Tuesday, November 8, 2022 @ 4:30 PM - 5:30 PM KST

Room B332, IBS (기초과학연구원)

Speaker

Jungho Ahn (안정호)
KAIST & IBS Discrete Mathematics Group
https://dimag.ibs.re.kr/home/jungho/

Let $\mathcal{F}$ be a family of graphs, and let $p$ and $r$ be nonnegative integers.
The $(p,r,\mathcal{F})$-Covering problem asks whether for a graph $G$ and an integer $k$, there exists a set $D$ of at most $k$ vertices in $G$ such that $G^p\setminus N_G^r[D]$ has no induced subgraph isomorphic to a graph in $\mathcal{F}$, where $G^p$ is the $p$-th power of $G$ and $N^r_G[D]$ is the set of all vertices in $G$ at distance at most $r$ from $D$ in $G$. The $(p,r,\mathcal{F})$-Packing problem asks whether for a graph $G$ and an integer $k$, $G^p$ has $k$ induced subgraphs $H_1,\ldots,H_k$ such that each $H_i$ is isomorphic to a graph in $\mathcal{F}$, and for distinct $i,j\in \{1, \ldots, k\}$, the distance between $V(H_i)$ and $V(H_j)$ in $G$ is larger than $r$. The $(p,r,\mathcal{F})$-Covering problem generalizes Distance-$r$ Dominating Set and Distance-$r$ Vertex Cover, and the $(p,r,\mathcal{F})$-Packing problem generalizes Distance-$r$ Independent Set and Distance-$r$ Matching. By taking $(p’,r’,\mathcal{F}’)=(pt, rt, \mathcal{F})$, we may formulate the $(p,r,\mathcal{F})$-Covering and $(p, r, \mathcal{F})$-Packing problems on the $t$-th power of a graph. Moreover, $(1,0,\mathcal{F})$-Covering is the $\mathcal{F}$-Free Vertex Deletion problem, and $(1,0,\mathcal{F})$-Packing is the Induced-$\mathcal{F}$-Packing problem.

We show that for every fixed nonnegative integers $p,r$ and every fixed nonempty finite family $\mathcal{F}$ of connected graphs, the $(p,r,\mathcal{F})$-Covering problem with $p\leq2r+1$ and the $(p,r,\mathcal{F})$-Packing problem with $p\leq2\lfloor r/2\rfloor+1$ admit almost linear kernels on every nowhere dense class of graphs, and admit linear kernels on every class of graphs with bounded expansion, parameterized by the solution size $k$. We obtain the same kernels for their annotated variants. As corollaries, we prove that Distance-$r$ Vertex Cover, Distance-$r$ Matching, $\mathcal{F}$-Free Vertex Deletion, and Induced-$\mathcal{F}$-Packing for any fixed finite family $\mathcal{F}$ of connected graphs admit almost linear kernels on every nowhere dense class of graphs and linear kernels on every class of graphs with bounded expansion. Our results extend the results for Distance-$r$ Dominating Set by Drange et al. (STACS 2016) and Eickmeyer et al. (ICALP 2017), and the result for Distance-$r$ Independent Set by Pilipczuk and Siebertz (EJC 2021).

This is joint work with Jinha Kim and O-joung Kwon.

Details

Date:
Tuesday, November 8, 2022
Time:
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:
,

Venue

Room B332
IBS (기초과학연구원) + Google Map

Organizer

Sang-il Oum (엄상일)
View Organizer Website
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.