The Hardness of 3-Uniform Hypergraph Coloring

被引：0
|
作者：
Irit Dinur*
Oded Regev†
Clifford Smyth‡
机构：
[1] The Hebrew University of Jerusalem,School of Computer Science and Engineering
[2] Tel-Aviv University,Department of Computer Science
[3] Carnegie Mellon University,Department of Mathematics
来源：
Combinatorica | 2005年 / 25卷
关键词：
68Q17;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c2 > c1 > 1, coloring a k-uniform c1-colorable hypergraph with c2 colors is NP-hard; the case k = 2, however, remains wide open.
引用
收藏
页码：519 / 535
页数：16
相关论文
共 50 条
  • [1] The hardness of 3-uniform hypergraph coloring
    Dinur, I
    Regev, O
    Smyth, C
    COMBINATORICA, 2005, 25 (05) : 519 - 535
  • [2] The hardness of 3-uniform hypergraph coloring
    Dinur, I
    Regev, O
    Smyth, C
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 33 - 40
  • [3] On hypergraph coloring and 3-uniform linear hypergraph set-indexers of a graph
    Paul, Viji
    Germina, K. A.
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (02)
  • [4] Hardness results for coloring 3-colorable 3-uniform hypergraphs
    Khot, S
    FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 23 - 32
  • [5] On the Number of Edges in a 3-Uniform Hypergraph with No (k
    Wang, Qinglin
    Tian, Yingzhi
    Feng, Lihua
    JOURNAL OF INTERCONNECTION NETWORKS, 2022, 22 (01)
  • [6] On the Vertex Cover Number of 3-Uniform Hypergraph
    Diao, Zhuo
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2021, 9 (02) : 427 - 440
  • [7] Edge Balanced 3-Uniform Hypergraph Designs
    Bonacini, Paola
    Gionfriddo, Mario
    Marino, Lucia
    MATHEMATICS, 2020, 8 (08)
  • [8] On the Vertex Cover Number of 3-Uniform Hypergraph
    Zhuo Diao
    Journal of the Operations Research Society of China, 2021, 9 : 427 - 440
  • [9] The characteristic polynomial of the complete 3-uniform hypergraph
    Zheng, Ya-Nan
    Linear Algebra and Its Applications, 2021, 627 : 275 - 286
  • [10] The characteristic polynomial of the complete 3-uniform hypergraph
    Zheng, Ya-Nan
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2021, 627 : 275 - 286
12345