7 search results - page 1 / 2 » On generalized Kneser hypergraph colorings |
JCT
2007
14 years 10 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...
FOCS
2002
IEEE
15 years 3 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...
102
click to vote
WAOA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
SIAMDM
2008
14 years 10 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
EJC
2007
14 years 10 months ago
2007
Abstract. Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex ∆A,H as the subdivision of the link of A induced...