← 研踪 PaperTrailarXiv:2609.24804 · v2
FPT Isomorphism Test for $F$-Free Tournaments
首次提交 2026-09-22 00:01
版本更新 2026-11-18 19:29
雷达观测 2026-11-19 15:04
摘要
We show that isomorphism of -free tournaments can be solved in FPT time , where denotes the size of , and denotes the size of the input tournaments. Our result extends on a previous FPT isomorphism test for tournaments of bounded twin-width [Grohe, Neuen 2024], as well as XP isomorphism tests parameterized by the VC dimension or the chromatic number [Raßmann, Schweitzer 2026]. It also implies that every non-trivial hereditary class of tournaments admits a polynomial-time isomorphism test. Our algorithm builds on a combination of spectral, geometric, combinatorial and group-theoretic tools.
作者备注:18 pages; second version adds missing attribution of earlier results and improves the write-up
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v2 · 2026-11-18 19:29 · 最新观测版本
FPT Isomorphism Test for $F$-Free Tournaments
We show that isomorphism of -free tournaments can be solved in FPT time , where denotes the size of , and denotes the size of the input tournaments. Our result extends on a previous FPT isomorphism test for tournaments of bounded twin-width [Grohe, Neuen 2024], as well as XP isomorphism tests parameterized by the VC dimension or the chromatic number [Raßmann, Schweitzer 2026]. It also implies that every non-trivial hereditary class of tournaments admits a polynomial-time isomorphism test. Our algorithm builds on a combination of spectral, geometric, combinatorial and group-theoretic tools.
查看此版本解读 →查看此版本原文 ↗