36 search results - page 3 / 8 » On the Chromatic Thresholds of Hypergraphs |
JCT
2007
13 years 5 months ago
2007
JCT
2011
13 years 7 days ago
2011
FOCS
2002
IEEE
13 years 10 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...
SIAMCOMP
2000
13 years 5 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...
ICALP
2000
Springer
13 years 9 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...