跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv: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
arXiv ↗PDF ↗

摘要

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 DD, there is a positive integer k(D)=(1+o(1))D/log⁡Dk(D)=(1+o(1))D/\log D such that every correspondence cover of any finite bipartite graph has a full correspondence packing if each color has at most DD forbidden partners and each vertex has k(D)k(D) colors. More precisely, we prove this conclusion with k(D)=⌈Dlog⁡D−2log⁡log⁡D−6⌉ k(D)=\left\lceil\frac{D}{\log D-2\log\log D-6}\right\rceil for every integer D≥⌈e20⌉D\ge\lceil e^{20}\rceil.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 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 DD, there is a positive integer k(D)=(1+o(1))D/log⁡Dk(D)=(1+o(1))D/\log D such that every correspondence cover of any finite bipartite graph has a full correspondence packing if each color has at most DD forbidden partners and each vertex has k(D)k(D) colors. More precisely, we prove this conclusion with k(D)=⌈Dlog⁡D−2log⁡log⁡D−6⌉ k(D)=\left\lceil\frac{D}{\log D-2\log\log D-6}\right\rceil for every integer D≥⌈e20⌉D\ge\lceil e^{20}\rceil.

查看此版本解读 →查看此版本原文 ↗