Scholarlink

As seen in Sect. 2.1 , we say that a convexity \(\mathcal {C}\) on a finite set V  is a convex geometry (or a geometric convexity) if it satisfies the Minkowski–Krein–Milman property: every convex set is the convex hull of its extreme points.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Convex Geometries in Graphs

  • 章节

  • 发表日期：

    2025年

查看全文
  • Júlio Araújo,
  • Mitre C. Dourado,
  • Fábio Protti,
  • Rudini M. Sampaio

摘要

As seen in Sect. 2.1 , we say that a convexity \(\mathcal {C}\) on a finite set V  is a convex geometry (or a geometric convexity) if it satisfies the Minkowski–Krein–Milman property: every convex set is the convex hull of its extreme points.