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 条

[21] Maximum Packing of λ-Fold Complete 3-Uniform Hypergraph with a Special Tetrahedron
Zhu, Yuzhe
Zhao, Hongtao
MATHEMATICS, 2024, 12 (10)
[22] Decomposing Complete 3-Uniform Hypergraph Kn(3) into 7-cycles
Yan, Hong
Jirimutu
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON LOGISTICS, ENGINEERING, MANAGEMENT AND COMPUTER SCIENCE (LEMCS 2015), 2015, 117 : 1272 - 1274
[23] A census of one-factorizations of the complete 3-uniform hypergraph of order 9
Khatirinejad, Mahdad
Ostergard, Patric R. J.
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2010, 47 : 239 - 245
[24] The smallest 3-uniform bi-hypergraph which is a realization of a given vector
Zhu, Xiao
Duan, Xiaoxiao
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2015, 61 : 182 - 191
[25] MAXIMUM PACKINGS OF THE λ-FOLD COMPLETE 3-UNIFORM HYPERGRAPH WITH LOOSE 3-CYCLES
Bunge, Ryan C.
Collins, Dontez
Conko-Camel, Daryl
El-Zanati, Saad I.
Liebrecht, Rachel
Vasquez, Alexander
OPUSCULA MATHEMATICA, 2020, 40 (02) : 209 - 225
[26] Decomposing Complete 3-Uniform Hypergraph K44(3) into 7-cycles
Guan, Meiling
Xu, Chunlei
Jirimutu
PROCEEDINGS OF THE 2017 7TH INTERNATIONAL CONFERENCE ON MECHATRONICS, COMPUTER AND EDUCATION INFORMATIONIZATION (MCEI 2017), 2017, 75 : 860 - 865
[27] Dense, irregular, yet always-graphic 3-uniform hypergraph degree sequences
Li, Runze
Miklos, Istvan
DISCRETE MATHEMATICS, 2025, 348 (09)
[28] A linear time algorithm for finding an Euler walk in a strongly connected 3-uniform hypergraph
Lonc, Zbigniew
Naroski, Pawel
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2012, 14 (01): : 147 - 158
[29] Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs
Bryant, Darryn
Herke, Sarada
Maenhaut, Barbara
Wannasit, Wannasiri
AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 60 : 227 - 254
[30] The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph
Cooley, Oliver
Mycroft, Richard
DISCRETE MATHEMATICS, 2017, 340 (06) : 1172 - 1179

← 1 2 3 4 5 →