当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
List colouring of two matroids through reduction to partition matroids
arXiv - CS - Discrete Mathematics Pub Date : 2019-11-24 , DOI: arxiv-1911.10485
Kristóf Bérczi; Tamás Schwarcz; Yutaro Yamaguchi

In the list coloring problem for two matroids, we are given matroids $M_1=(S,{\cal I}_1)$ and $M_2=(S,{\cal I}_2)$ on the same ground set $S$, and the goal is to determine the smallest number $k$ such that given arbitrary lists $L_s$ of $k$ colors for $s\in S$, it is possible to choose a color from each list so that every monochromatic set is independent in both $M_1$ and $M_2$. When both $M_1$ and $M_2$ are partition matroids, Galvin's list coloring theorem for bipartite graphs gives the answer. One of the main open questions is to decide if there exists a constant $c$ such that if the coloring number is $k$ (i.e., the ground set can be partitioned into $k$ common independent sets), then the list coloring number is at most $c\cdot k$. We consider matroid classes that appear naturally in combinatorial optimization problems, namely graphic matroids, paving matroids and gammoids. We show that if both matroids are from these fundamental classes, then the list coloring number is at most twice the coloring number. The proof is based on a new approach that reduces a matroid to a partition matroid without increasing its coloring number too much, and might be of independent combinatorial interest. In particular, we show that if $M=(S,{\cal I})$ is a matroid in which $S$ can be partitioned into $k$ independent sets, then there exists a partition matroid $N=(S,{\cal J})$ with ${\cal J}\subseteq{\cal I}$ in which $S$ can be partitioned into (A) $k$ independent sets if $M$ is a transversal matroid, (B) $2k-1$ independent sets if $M$ is a graphic matroid, (C) $\lceil kr/(r-1)\rceil$ independent sets if $M$ is a paving matroid of rank $r$, and (D) $2k-2$ independent sets if $M$ is a gammoid. We extend our results by showing that the existence of a matroid $N$ with $\chi(N)\leq 2\chi(M)$ implies the existence of a matroid $N'$ with $\chi(N')\leq 2\chi(M')$ for every truncation $M'$ of $M$.
更新日期:2020-02-20

 

全部期刊列表>>
宅家赢大奖
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
x-mol收录
自然科研论文编辑服务
南方科技大学
南方科技大学
西湖大学
中国科学院长春应化所于聪-4-8
复旦大学
课题组网站
X-MOL
香港大学化学系刘俊治
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug