← 研踪 PaperTrailarXiv:2611.20504 · v1
A proof of a conjecture on bipartite correspondence packing
首次提交 2026-11-16 12:15
版本更新 2026-11-16 12:15
雷达观测 2026-11-17 13:07
摘要
A correspondence cover assigns a set of possible colors to each vertex of a graph. For each edge, a matching between the two endpoint color sets specifies the forbidden color pairs. A correspondence coloring selects one color at each vertex so that no forbidden pair is selected. A full correspondence packing is a collection of such colorings that uses every color at each vertex exactly once. We prove a conjecture of Cambie, Cames van Batenburg, Davies, and Kang [Random Structures & Algorithms 64 (2024), 62--93]. For every sufficiently large , there is a positive integer such that every correspondence cover of any finite bipartite graph has a full correspondence packing if each color has at most forbidden partners and each vertex has colors. More precisely, we prove this conclusion with for every integer .
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 12:15 · 最新观测版本
A proof of a conjecture on bipartite correspondence packing
A correspondence cover assigns a set of possible colors to each vertex of a graph. For each edge, a matching between the two endpoint color sets specifies the forbidden color pairs. A correspondence coloring selects one color at each vertex so that no forbidden pair is selected. A full correspondence packing is a collection of such colorings that uses every color at each vertex exactly once. We prove a conjecture of Cambie, Cames van Batenburg, Davies, and Kang [Random Structures & Algorithms 64 (2024), 62--93]. For every sufficiently large , there is a positive integer such that every correspondence cover of any finite bipartite graph has a full correspondence packing if each color has at most forbidden partners and each vertex has colors. More precisely, we prove this conclusion with for every integer .
查看此版本解读 →查看此版本原文 ↗