Niche hypergraphs

If D = (V,A) is a digraph, its niche hypergraph Nℋ(D) = (V, ℰ) has the edge set ℰ = {ℯ ⊆ V | |e| ≥ 2 ∧ ∃ v ∈ V : e = ND-(v) ∨ ℯ = ND+(v)}. Niche hypergraphs generalize the well-known niche graphs (see [11]) and are closely related to competition hypergraphs (see [40]) as well as double competition hypergraphs (see [33]). We present several properties of niche hypergraphs of acyclic digraphs

スペクトラルグラフ理論を用いた離散構造とアルゴリズムの研究

科学研究費助成事業 研究成果報告書：若手研究(B)2015-2017課題番号 : 15K2088

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

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

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

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