Abstract

The generalization of classical results about convex sets in ℝn 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. P3-convexity has been proposed in connection with rumour and disease spreading processes in networks and the Radon number allows generalizations of Radon's classical convexity result. We establish hardness results, describe efficient algorithms for trees, and prove a best-possible bound on the Radon number of connected graphs.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.