On independent sets in hypergraphs

Details On independent sets in hypergraphs On independent sets in hypergraphs

2011-06-15

arxiv.org/abs/1106.3098v1

Mathematics

Combinatorics

Scientific paper

The independence number of a hypergraph H is the size of a largest set of vertices containing no edge of H. In this paper, we prove new sharp bounds on the independence number of n-vertex (r+1)-uniform hypergraphs in which every r-element set is contained in at most d edges, where 0 < d < n/(log n)^{3r^2}. Our relatively short proof extends a method due to Shearer. We give an application to hypergraph Ramsey numbers involving independent neighborhoods.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188927