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

Abstract

If H=(V, E) is a hypergraph, its edge intersection hypergraph EI( H)=(V, EEI) has the edge set EEI=\e1 e2 \ |\ e1, e2 ∈ E \ \ e1 ≠ e2 \ \ |e1 e2 |≥2\. Using the so-called clique-fusion, we show that nearly all cacti are edge intersection hypergraphs of 3-uniform hypergraphs. In the proof we make use of known characterizations of the trees and the cycles which are edge intersection hypergraphs of 3-uniform hypergraphs (see arXiv:1901.06292).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…