Title
An upper bound on the P3-Radon number.
Abstract
The generalization of classical results about convex sets in Rn to abstract convexity spaces, defined by sets of paths in graphs, leads to many challenging structural and algorithmic problems. Here we study the Radon number for the P3-convexity on graphs.
Year
DOI
Venue
2012
10.1016/j.disc.2012.05.002
Discrete Mathematics
Keywords
DocType
Volume
Graph convexity,Radon partition,Radon number
Journal
312
Issue
ISSN
Citations 
16
0012-365X
4
PageRank 
References 
Authors
0.50
9
6