Approximating coloring and maximum independent sets in 3-uniform hypergraphs

被引：0

作者：

Krivelevich, M ^{[1
]}

Nathaniel, R ^{[1
]}

Sudakov, B ^{[1
]}

机构：

[1] Tel Aviv Univ, Raymond & Beverly Sackler Fac Exact Sci, Dept Math, IL-69978 Tel Aviv, Israel

来源：

PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 2001年

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：327 / 328

页数：2

共 50 条

[31] Judicious partitions of 3-uniform hypergraphs
Bollobás, B
Scott, AD
EUROPEAN JOURNAL OF COMBINATORICS, 2000, 21 (03) : 289 - 300
[32] 3-UNIFORM HYPERGRAPHS AND LINEAR CYCLES
Ergemlidze, Beka
Gyori, Ervin
Methuku, Abhishek
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (02) : 933 - 950
[33] Packing cliques in 3-uniform hypergraphs
Javadi, Ramin
Poorhadi, Ehsan
Fallah, Farshad
JOURNAL OF COMBINATORIAL DESIGNS, 2020, 28 (08) : 580 - 603
[34] Large sets of Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
Zhao, Hongtao
JOURNAL OF COMBINATORIAL DESIGNS, 2018, 26 (12) : 581 - 594
[35] SOLVING A CONJECTURE OF SEDLACEK - MAXIMAL EDGE SETS IN THE 3-UNIFORM SUMSET HYPERGRAPHS
MARTIN, N
DISCRETE MATHEMATICS, 1994, 125 (1-3) : 273 - 277
[36] The Hardness of 3-Uniform Hypergraph Coloring
Irit Dinur*
Oded Regev†
Clifford Smyth‡
Combinatorica, 2005, 25 : 519 - 535
[37] The hardness of 3-uniform hypergraph coloring
Dinur, I
Regev, O
Smyth, C
COMBINATORICA, 2005, 25 (05) : 519 - 535
[38] 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
[39] Decompositions of the 3-uniform hypergraphs Kv(3) into hypergraphs of a certain type
Tao Feng
Yan-xun Chang
Science in China Series A: Mathematics, 2007, 50 : 1035 - 1044
[40] Decompositions of the 3-uniform hypergraphs Kv(3) into hypergraphs of a certain type
Feng, Tao
Chang, Yan-xun
SCIENCE IN CHINA SERIES A-MATHEMATICS, 2007, 50 (07): : 1035 - 1044

← 1 2 3 4 5 →