On the Hypercompetition Numbers of Hypergraphs with Maximum Degree at Most Two

Abstract

In this note, we give an easy and short proof for the theorem by Park and Kim stating that the hypercompetition numbers of hypergraphs with maximum degree at most two is at most two.

Keywords

• digraph
• competition hypergraph
• hypercompetition number.