Covering numbers for graphs and hypergraphs

Details Covering numbers for graphs and hypergraphs Covering numbers for graphs and hypergraphs

2010-09-29

arxiv.org/abs/1009.5893v1

Mathematics

Combinatorics

Scientific paper

The covering number of a hypergraph H is the largest integer k such that the
edges of H can be partitioned into k classes such that every vertex is incident
with edges from every class. We prove a number of results on covering numbers,
and state some open problems.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-523847