Separating hyperplanes of edge polytopes

Abstract: Let

G

be a finite connected simple graph with

d

vertices and let

P c_{G} s u b s e t R R^{d}

be the edge polytope of

G

. We call

P c_{G}

emph{decomposable} if

P c_{G}

decomposes into integral polytopes

P c_{G^{+}}

and

P c_{G^{-}}

via a hyperplane. In this paper, we explore various aspects of decomposition of

P c_{G}

: we give an algorithm deciding the decomposability of

P c_{G}

, we prove that

P c_{G}

is normal if and only if both

P c_{G^{+}}

and

P c_{G^{-}}

are normal, and we also study how a condition on the toric ideal of

P c_{G}

(namely, the ideal being generated by quadratic binomials) behaves under decomposition.

Recommendations

Cited in

(6)

This page was built for publication: Separating hyperplanes of edge polytopes