Competition hypergraphs Original Research Article

If D=(V,A) is a digraph, its competition hypergraph CH(D) has vertex set V and e⊆V is an edge of CH(D) iff |e|⩾2 and there is a vertex v∈V, such that e=N−(v)={w∈V|(w,v)∈A}. Besides a motivation for this new concept, closely related to the well-known competition graphs, we present several properties of competition hypergraphs and discuss connections to corresponding results for competition graphs.