Coloring Simple Hypergraphs

Details Coloring Simple Hypergraphs Coloring Simple Hypergraphs

2008-09-17

arxiv.org/abs/0809.2979v2

Mathematics

Combinatorics

34 pages

Scientific paper

Fix an integer $k \ge 3$. A $k$-uniform hypergraph is simple if every two edges share at most one vertex. We prove that there is a constant $c$ depending only on $k$ such that every simple $k$-uniform hypergraph $H$ with maximum degree $\D$ has chromatic number satisfying $$\chi(H)

Affiliated with

Also associated with

No associations

Rating

Coloring Simple 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 Coloring Simple Hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Coloring Simple Hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-661924