Convexity and fixed-point properties in Helly graphs (Q5931453): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q128090048, #quickstatements; #temporary_batch_1730724344231 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128090048 / rank | |||
Normal rank | |||
Latest revision as of 13:47, 4 November 2024
scientific article; zbMATH DE number 1591119
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convexity and fixed-point properties in Helly graphs |
scientific article; zbMATH DE number 1591119 |
Statements
Convexity and fixed-point properties in Helly graphs (English)
0 references
24 August 2002
0 references
A (strongly) Helly graph is a connected graph for which any finite (resp. finite or infinite) family of pairwise non-disjoint balls has a non-empty intersection. Many interesting properties of (strongly) Helly graphs are known, such as results concerning geodesic convexity, fixed point properties, etc. This article is a survey of such a type of results.
0 references
infinite graph
0 references
Helly graph
0 references
convexity
0 references
fixed point
0 references
