Abstract
If H = (V,E) is a hypergraph, its edge intersection hypergraph EI(H) = (V,EEI) hastheedgesetEEI={e1∩e2|e1,e2∈E∧e1̸=e2 ∧|e1∩e2|≥2}.Besidesinvestigating several structural properties of edge intersection hypergraphs, we prove that all trees but seven exceptional ones are edge intersection hypergraphs of 3-uniform hypergraphs.
| Original language | English |
|---|---|
| Publication status | Published - 2019 |