Tight Lower Bounds for the Complexity of Multicoloring

Author:

Bonamy Marthe1,Kowalik łUkasz2,Pilipczuk Michał2,Socała Arkadiusz2,Wrochna Marcin2

Affiliation:

1. CNRS, LaBRI, Bordeaux, France

2. Institute of Informatics, University of Warsaw, Warsaw, Poland

Abstract

In the multicoloring problem, also known as ( a : b )- coloring or b-fold coloring , we are given a graph G and a set of a colors, and the task is to assign a subset of b colors to each vertex of G so that adjacent vertices receive disjoint color subsets. This natural generalization of the classic coloring problem (the b =1 case) is equivalent to finding a homomorphism to the Kneser graph KG a,b and gives relaxations approaching the fractional chromatic number. We study the complexity of determining whether a graph has an ( a : b )-coloring. Our main result is that this problem does not admit an algorithm with runtime f ( b )ċ 2 o (log bn for any computable f(b) unless the Exponential Time Hypothesis (ETH) fails. A ( b +1) n ċ poly( n )-time algorithm due to Nederlof [33] shows that this is tight. A direct corollary of our result is that the graph homomorphism problem does not admit a 2 O ( n + h ) algorithm unless the ETH fails even if the target graph is required to be a Kneser graph. This refines the understanding given by the recent lower bound of Cygan et al. [9]. The crucial ingredient in our hardness reduction is the usage of detecting matrices of Lindström [28], which is a combinatorial tool that, to the best of our knowledge, has not yet been used for proving complexity lower bounds. As a side result, we prove that the runtime of the algorithms of Abasi et al. [1] and of Gabizon et al. [14] for the r -monomial detection problem are optimal under the ETH.

Funder

European Research Council

Narodowe Centrum Nauki

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Theory and Mathematics,Theoretical Computer Science

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3