AbstractSturmfels–Sullivant conjectured that the cut polytope of a graph is normal if and only if the graph has no K5 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
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractWe introduce the property of convex normality of rational polytopes and give a dimensionally...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractSturmfels–Sullivant conjectured that the cut polytope of a graph is normal if and only if th...
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate som...
AbstractNormal graphs can be considered as weaker perfect graphs in several ways. However, only few ...
The max-cut problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, wi...
10 pages, 1 figureInternational audienceWe show that the graph of a simplicial polytope of dimension...
AbstractA graph is normal if there exists a cross-intersecting pair of set families one of which con...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
Faculty adviser: Victor ReinerIn this paper we begin by identifying some general properties shared b...
Normal graphs are defined in terms of cross-intersecting set families: a graph is normal if it admit...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractWe introduce the property of convex normality of rational polytopes and give a dimensionally...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
AbstractSturmfels–Sullivant conjectured that the cut polytope of a graph is normal if and only if th...
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate som...
AbstractNormal graphs can be considered as weaker perfect graphs in several ways. However, only few ...
The max-cut problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, wi...
10 pages, 1 figureInternational audienceWe show that the graph of a simplicial polytope of dimension...
AbstractA graph is normal if there exists a cross-intersecting pair of set families one of which con...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
Cut problems on graphs are a well-known and intensively studied class of optimization problems. In ...
Faculty adviser: Victor ReinerIn this paper we begin by identifying some general properties shared b...
Normal graphs are defined in terms of cross-intersecting set families: a graph is normal if it admit...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractAt the core of the Robertson–Seymour theory of graph minors lies a powerful structure theore...
AbstractWe introduce the property of convex normality of rational polytopes and give a dimensionally...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
DOI
Add to ORKG