Acessibilidade / Reportar erro

On the convex hull of 3-cycles of the complete graph

Let Kn be the complete undirected graph with n vertices. A 3-cycle is a cycle consisting of 3 edges. The 3-cycle polytope is defined as the convex hull of the incidence vectors of all 3-cycles in Kn. In this paper, we present a polyhedral analysis of the 3-cycle polytope. In particular, we give several classes of facet defining inequalities of this polytope and we prove that the separation problem associated to one of these classes of inequalities is NP-complete. Finally, it is proved that the 3-cycle polytope is a 2-neighborly polytope.

polytope; cycle; facet; NP-completeness


Sociedade Brasileira de Pesquisa Operacional Rua Mayrink Veiga, 32 - sala 601 - Centro, 20090-050 Rio de Janeiro RJ - Brasil, Tel.: +55 21 2263-0499, Fax: +55 21 2263-0501 - Rio de Janeiro - RJ - Brazil
E-mail: sobrapo@sobrapo.org.br