On the hypercompetition numbers of hypergraphs

Details On the hypercompetition numbers of hypergraphs On the hypercompetition numbers of hypergraphs

2010-05-31

arxiv.org/abs/1005.5622v3

Ars Combinatoria 100 (2011) 151-159

Mathematics

Combinatorics

9 pages

Scientific paper

The competition hypergraph $C{\cH}(D)$ of a digraph $D$ is the hypergraph such that the vertex set is the same as $D$ and $e \subseteq V(D)$ is a hyperedge if and only if $e$ contains at least 2 vertices and $e$ coincides with the in-neighborhood of some vertex $v$ in the digraph $D$. Any hypergraph with sufficiently many isolated vertices is the competition hypergraph of an acyclic digraph. The hypercompetition number $hk(\cH)$ of a hypergraph $\cH$ is defined to be the smallest number of such isolated vertices. In this paper, we study the hypercompetition numbers of hypergraphs. First, we give two lower bounds for the hypercompetition numbers which hold for any hypergraphs. And then, by using these results, we give the exact hypercompetition numbers for some family of uniform hypergraphs. In particular, we give the exact value of the hypercompetition number of a connected graph.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-627549