M. Sonntag

most citedEdge intersection hypergraphs - a new hypergraph concept

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2022

Cycles as edge intersection hypergraphs of $k$ -uniform hypergraphs ( $k \leq 6$ ) -- a constructive approach

Sophie Pätz, Martin Sonntag

If $H = (V, E)$ is a hypergraph, its edge intersection hypergraph $E I (H) = (V, E^{E I})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal…

math.CO2019

Nearly all cacti are edge intersection hypergraphs of 3-uniform hypergraphs

Martin Sonntag, Hanns-Martin Teichert

If $H = (V, E)$ is a hypergraph, its edge intersection hypergraph $E I (H) = (V, E^{E I})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal…

math.CO2019

Cycles as edge intersection hypergraphs

Martin Sonntag, Hanns-Martin Teichert

If $H = (V, E)$ is a hypergraph, its edge intersection hypergraph $E I (H) = (V, E^{E I})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal…

math.CO2019★ 2 cited

Edge intersection hypergraphs - a new hypergraph concept

Martin Sonntag, Hanns-Martin Teichert

If $H = (V, E)$ is a hypergraph, its edge intersection hypergraph $E I (H) = (V, E^{E I})$ has the edge set ${\cal E}^{EI}=\{e_1 \cap e_2 \ |\ e_1, e_2 \in {\cal…

Cycles as edge intersection hypergraphs of k-uniform hypergraphs (k≤6) -- a constructive approach

Nearly all cacti are edge intersection hypergraphs of 3-uniform hypergraphs

Cycles as edge intersection hypergraphs

Edge intersection hypergraphs - a new hypergraph concept

Cycles as edge intersection hypergraphs of $k$ -uniform hypergraphs ( $k \leq 6$ ) -- a constructive approach