Intersection theorems for infinite families of convex sets in graphs (Q1276308)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Intersection theorems for infinite families of convex sets in graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intersection theorems for infinite families of convex sets in graphs |
scientific article |
Statements
Intersection theorems for infinite families of convex sets in graphs (English)
0 references
24 January 1999
0 references
A Helly-type theorem determines the least cardinal \(n\) such that any family of ``convex'' sets in some infinite graph has a nonempty intersection whenever each of its subfamilies of cardinality less than \(n\) has a nonempty intersection. The author studies geodesic convexity. Most of his results ``remain valid if we replace the geodesic convexity by any graph convexity, and in particular, by minimal path convexity''.
0 references
infinite graph
0 references
geodesic convexity
0 references
Helly number
0 references
