On the hypercompetition numbers of hypergraphs.

MaRDI QIDQ3166443zbMATH OpenFDO

Authors Boram Park, Yoshio Sano

Publication date 12 October 2012

Full work available at URL https://arxiv.org/abs/1005.5622

zbMATH Keywords

competition graphcompetition hypergraphcompetition numberhypercompetition number

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Hypergraphs (05C65)

Abstract: The competition hypergraph $CcH(D)$ of a digraph $D$ is the hypergraph such that the vertex set is the same as $D$ and $esubseteqV(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.

Recommendations

• Competition hypergraphs
• Competition hypergraphs of products of digraphs
• The double competition hypergraph of a digraph
• Competition numbers and phylogeny numbers of connected graphs and hypergraphs
• On Opsut's conjecture for hypercompetition numbers of hypergraphs

Cited in

(10)

• Competition hypergraphs
• Niche hypergraphs of products of digraphs
• The competition hypergraphs of doubly partial orders
• On the hypercompetition numbers of hypergraphs with maximum degree at most two
• Niche hypergraphs
• Competition hypergraphs of digraphs with certain properties I. Strong connectedness
• The double competition hypergraph of a digraph
• scientific article; zbMATH DE number 5064049 (Why is no real title available?)
• Enumeration of hypergraphs. I
• On Opsut's conjecture for hypercompetition numbers of hypergraphs

This page was built for publication: On the hypercompetition numbers of hypergraphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166443)