Equitable coloring of k-uniform hypergraphs

Details Equitable coloring of k-uniform hypergraphs Equitable coloring of k-uniform hypergraphs

2002-02-22

arxiv.org/abs/math/0202230v1

Mathematics

Combinatorics

10 Pages

Scientific paper

Let $H$ be a $k$-uniform hypergraph with $n$ vertices. A {\em strong $r$-coloring} is a partition of the vertices into $r$ parts, such that each edge of $H$ intersects each part. A strong $r$-coloring is called {\em equitable} if the size of each part is $\lceil n/r \rceil$ or $\lfloor n/r \rfloor$. We prove that for all $a \geq 1$, if the maximum degree of $H$ satisfies $\Delta(H) \leq k^a$ then $H$ has an equitable coloring with $\frac{k}{a \ln k}(1-o_k(1))$ parts. In particular, every $k$-uniform hypergraph with maximum degree $O(k)$ has an equitable coloring with $\frac{k}{\ln k}(1-o_k(1))$ parts. The result is asymptotically tight. The proof uses a double application of the non-symmetric version of the Lov\'asz Local Lemma.

Affiliated with

Also associated with

No associations

Rating

Equitable coloring of k-uniform hypergraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Equitable coloring of k-uniform hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Equitable coloring of k-uniform hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-339581