Edge intersection hypergraphs - a new hypergraph concept

arXiv1901.06292MaRDI QIDQ6312682FDOQ6312682

Authors: Martin Sonntag, Hanns-Martin Teichert

Publication date: 18 January 2019

Abstract: If

c a l H = (V, c a l E)

is a hypergraph, its edge intersection hypergraph

E I (c a l H) = (V, {c a l E}^{E I})

has the edge set

{c a l E}^{E I} = e_{1} c a p e_{2} | e_{1}, e_{2} i n c a l E w e d g e e_{1} e q e_{2} w e d g e | e_{1} c a p e_{2} | g e q 2

. Besides investigating several structural properties of edge intersection hypergraphs, we prove that all trees but seven exceptional ones are edge intersection hypergraphs of 3-uniform hypergraphs.

Mathematics Subject Classification ID

Hypergraphs (05C65)

This page was built for publication: Edge intersection hypergraphs - a new hypergraph concept

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