36 search results - page 3 / 8 » On the Chromatic Thresholds of Hypergraphs |
183
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
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...
175
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...
165
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...