More on discrete convexity
Abstract
In several recent papers some concepts of convex analysis were extended to discrete sets. The present paper is one more step in this direction. It is well known that a local minimum of a convex function is always its global minimum. We study some discrete objects that share this property and provide several examples of convex families related to graphs and to two-person games in normal form.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
Advanced Combinatorial Mathematics
Advanced Graph Theory Research
Publication details
- Journal / source
- Discrete Applied Mathematics
- Volume
- 385
- Pages
- 146–164
- Publication date
- 30 January 2026
- Language
- EN