Decomposability of Abstract and Path-Induced Convexities in Hypergraphs

Autor: Marina Moscarini, Francesco M. Malvestuto
Jazyk: angličtina
Rok vydání: 2015
Předmět:
Zdroj: Discussiones Mathematicae Graph Theory, Vol 35, Iss 3, Pp 493-515 (2015)
ISSN: 2083-5892
Popis: An abstract convexity space on a connected hypergraph H with vertex set V (H) is a family C of subsets of V (H) (to be called the convex sets of H) such that: (i) C contains the empty set and V (H), (ii) C is closed under intersection, and (iii) every set in C is connected in H. A convex set X of H is a minimal vertex convex separator of H if there exist two vertices of H that are separated by X and are not separated by any convex set that is a proper subset of X. A nonempty subset X of V (H) is a cluster of H if in H every two vertices in X are not separated by any convex set. The cluster hypergraph of H is the hypergraph with vertex set V (H) whose edges are the maximal clusters of H. A convexity space on H is called decomposable if it satisfies the following three properties
Databáze: OpenAIRE