← 研踪 PaperTrailarXiv:2611.21966 · v1
Supersaturation and reconfiguration diameter of independent transversals
首次提交 2026-11-17 06:49
版本更新 2026-11-17 06:49
雷达观测 2026-11-18 19:43
摘要
Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree . It is a classic result that when all parts have size at least , the collection is nonempty. Recently, it was found that if the parts have size at least , then every pair of independent transversals is connected, within the collection, by a sequence of one-vertex reconfigurations. We prove, among other results, that there are exponentially many independent transversals when the parts have size at least , and that the reconfiguration diameter is at most linear in the number of parts when the parts have size at least .
作者备注:14 pages, 1 figure
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-17 06:49 · 最新观测版本
Supersaturation and reconfiguration diameter of independent transversals
Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree . It is a classic result that when all parts have size at least , the collection is nonempty. Recently, it was found that if the parts have size at least , then every pair of independent transversals is connected, within the collection, by a sequence of one-vertex reconfigurations. We prove, among other results, that there are exponentially many independent transversals when the parts have size at least , and that the reconfiguration diameter is at most linear in the number of parts when the parts have size at least .
查看此版本解读 →查看此版本原文 ↗