Mathematics – Combinatorics
Scientific paper
2009-06-29
Discrete Mathematics 310 (2010), 1160--1166
Mathematics
Combinatorics
11 pages, References added, notation improved
Scientific paper
Sturmfels-Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K_5 minor. In the present paper, it is proved that the normality of cut polytopes of graphs is a minor closed property. By using this result, we have large classes of normal cut polytopes. Moreover, it turns out that, in order to study the conjecture, it is enough to consider 4-connected plane triangulations.
No associations
LandOfFree
Normality of cut polytopes of graphs is a minor closed property does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Normality of cut polytopes of graphs is a minor closed property, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Normality of cut polytopes of graphs is a minor closed property will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-248145