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 条

[31] The coloring complex and cyclic coloring complex of a complete k-uniform hypergraph
Rundell, Sarah Crown
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2012, 119 (05) : 1095 - 1109
[32] Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs
Filakovsky, Marek
Nakajima, Tamio-Vesa
Oprsal, Jakub
Tasinato, Gianluca
Wagner, Uli
41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
[33] On 2-Factorizations of the Complete 3-Uniform Hypergraph of Order 12 Minus a 1-Factor
Adams, Peter
El-Zanati, Saad, I
Florido, Peter
Turner, William
COMBINATORICS, GRAPH THEORY AND COMPUTING, SEICCGTC 2021, 2024, 448 : 325 - 331
[34] Prime 3-Uniform Hypergraphs
Boussairi, Abderrahim
Chergui, Brahim
Ille, Pierre
Zaidi, Mohamed
GRAPHS AND COMBINATORICS, 2021, 37 (06) : 2737 - 2760
[35] Prime 3-Uniform Hypergraphs
Abderrahim Boussaïri
Brahim Chergui
Pierre Ille
Mohamed Zaidi
Graphs and Combinatorics, 2021, 37 : 2737 - 2760
[36] Matchings in 3-uniform hypergraphs
Kuehn, Daniela
Osthus, Deryk
Treglown, Andrew
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2013, 103 (02) : 291 - 305
[37] Partitioning 3-uniform hypergraphs
Ma, Jie
Yu, Xingxing
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2012, 102 (01) : 212 - 232
[38] Wickets in 3-uniform hypergraphs
Solymosi, Jozsef
DISCRETE MATHEMATICS, 2024, 347 (06)
[39] Matching in 3-uniform hypergraphs
Zhang, Yi
Lu, Mei
DISCRETE MATHEMATICS, 2019, 342 (06) : 1731 - 1737
[40] Decompositions of λ-fold complete bipartite 3-uniform hypergraphs λKn,n(3) into hypergraph K4(3) - e
Zhao, Hongtao
Zhang, Qingyun
UTILITAS MATHEMATICA, 2020, 115 : 227 - 237

← 1 2 3 4 5 →