2025/07/29 by de Diego, María José Chávez, Moreno, Pablo Montero, Villar-Liñán, María Trinidad
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2507.22957
Let G=(V(G),E(G)) be a graph and H=(V(H),E(H)) be a hypergraph. The hypergraph H is a \it Berge-G if there is a bijection f : E(G) ↦ E(H) such that for each e ∈ E(G) we have e ⊆ f(e). We define \it dilations of G as a particular subfamily of not necessarily uniform Berge-G hypergraphs. We examine domination, matching and transversal numbers and some relation between these parameters in that family of hypergraphs. Our work generalizes previous results concerning generalized power hypergraphs.