Scholarlink

<p>The matching polytope of a graph <i>G</i> is the convex hull of the indicator vectors of the matchings on <i>G</i>. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes possess the integer decomposition property. As a special case study, we examine the matching polytopes of wheel graphs and show that they are <i>not</i> Gorenstein, but <i>do</i> possess the integer decomposition property.</p>

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

Matching Polytopes, Gorensteinness, and the Integer Decomposition Property

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年4月16日

查看全文
  • Benjamin Eisley,
  • Koji Matsushita,
  • Andrés R. Vindas-Meléndez

摘要

The matching polytope of a graph G is the convex hull of the indicator vectors of the matchings on G. We characterize the graphs whose associated matching polytopes are Gorenstein, and then prove that all Gorenstein matching polytopes possess the integer decomposition property. As a special case study, we examine the matching polytopes of wheel graphs and show that they are not Gorenstein, but do possess the integer decomposition property.