论文标题
浸入锦标赛的多项式内核
Polynomial kernel for immersion hitting in tournaments
论文作者
论文摘要
对于不隔离顶点的固定简单的Digraph $ h $，我们考虑从给定比赛中删除弧线的问题，以获取不包含$ h $沉浸的digraph。我们证明，在每$ h $中，当通过已删除的弧数参数化时，此问题就会承认一个多项式内核。内核大小的界限取决于$ h $。
For a fixed simple digraph $H$ without isolated vertices, we consider the problem of deleting arcs from a given tournament to get a digraph which does not contain $H$ as an immersion. We prove that for every $H$, this problem admits a polynomial kernel when parameterized by the number of deleted arcs. The degree of the bound on the kernel size depends on $H$.
