Convexities related to path properties on graphs

A feasible family of paths in a connected graph G is a family that contains at least one path between any pair of vertices in G. Any feasible path family defines a convexity on G. Well-known instances are: the geodesics, the induced paths, and all paths. We propose a more general approach for such 'path properties'. We survey a number of results from this perspective, and present a number of new results. We focus on the behaviour of such convexities on the Cartesian product of graphs and on the classical convexity invariants, such as the Caratheodory, Helly and Radon numbers in relation with Graph invariants, such as the clique number and other Graph properties. (c) 2004 Elsevier B.V. All rights reserved