On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four.pdfVIP

下载本文档

6
0
约2.24万字
约 11页
2017-04-11 发布于江苏
举报
版权申诉

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four.pdf

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four

On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four Arnaud Pe?cher a,1 a Laboratoire Bordelais de Recherche Informatique (LaBRI), 351 cours de la Libe?ration, 33405 Talence, France Annegret K. Wagler b,2 b Otto-von-Guericke-Universita?t Magdeburg, Fakulta?t fu?r Mathematik, Institut fu?r Mathematische Optimierung (IMO), Universita?tsplatz 2, 39106 Magdeburg, Germany Abstract Graphs with circular symmetry, called webs, are relevant for describing the stable set poly- topes of two larger graph classes, quasi-line graphs [6,10] and claw-free graphs [5,6]. Pro- viding a decent linear description of the stable set polytopes of claw-free graphs is a long- standing problem [7]. However, even the problem of finding all facets of stable set poly- topes of webs is open. So far, it is only known that stable set polytopes of webs with clique number ≤ 3 have rank facets only [3,13] while there are examples with clique number 4 having non-rank facets [8,10,9]. The aim of the present paper is to treat the remaining case with clique number = 4: we provide an infinite sequence of such webs whose stable set polytopes admit non-rank facets. Key words: web, rank-perfect graph, stable set polytope, (non-)rank facet 1 Introduction A natural generalization of odd holes and odd antiholes are graphs with circular symmetry of their maximum cliques and stable sets, called webs: a web W kn is a graph with nodes 1, . . . , nwhere ij is an edge iff i and j differ by at most k (modulo Email addresses: pecher@labri.fr (Arnaud Pe?cher), wagler@imo.math.uni-magdeburg.de (Annegret K. Wagler). 1 this work was supported by DONET 2 this work supported by the Deutsche Forschungsgemeinschaft (Gr 883/9–1) Preprint submitted to Elsevier Science 7 July 2005 n) and i 6= j. These graphs belong to the classes of quasi-line graphs and claw-free graphs and are, besides line graphs, relevant for describing the stable set polytopes of those larger graph classes [5,6,10]. (The line graph of a