4 search results - page 1 / 1 » The chromatic number of almost stable Kneser hypergraphs |
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...
JCT
2007
13 years 5 months ago
2007
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sssS, “generalized r-uniform Kneser hypergraphs with intersection multi...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...