On the hypercompetition numbers of hypergraphs

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-627549

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.