Add to ORKGFaculty adviser: Victor ReinerIn this paper we begin by identifying some general properties shared by all cut polytopes which can be used to analyze the general cut polytope in detail. We then characterize the face vectors and diameter of the cut polytopes of all chordless graphs. We finish with a brief summary of cd-indices and their possible application to broad classes of cut polytopes.This research was supported by the Undergraduate Research Opportunities Program (UROP)
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied...
In this paper we study the directed cut cone and polytope which are the positive hull and convex hul...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
AbstractSturmfels–Sullivant conjectured that the cut polytope of a graph is normal if and only if th...
The motivation for this paper is the integer linear programming approach to learning the structure o...
This theoretical paper is inspired by an \em integer linear programming (ILP) approach to learning t...
AbstractGiven an undirected graph G, a uniform cut polytope is defined as the convex hull of the inc...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied...
In this paper we study the directed cut cone and polytope which are the positive hull and convex hul...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...
For an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex hull of...
AbstractFor an undirected connected graph G, the cut polyhedron cut(G) is the dominant of the convex...
AbstractGiven a graph G = (V, E), a cut in G that partitions V into two sets with ⌊12¦V¦⌋ and ⌈12¦V¦...
AbstractThe cut polytope Pn is the convex hull of the incidence vectors of all cuts of the complete ...
Given a graph G = (V, E), a cut in G that partitions V into two sets with right perpendicular 1/2V l...
The cut polytopeP n is the convex hull of the incidence vectors of the cuts (i.e. complete bipartite...
AbstractSturmfels–Sullivant conjectured that the cut polytope of a graph is normal if and only if th...
The motivation for this paper is the integer linear programming approach to learning the structure o...
This theoretical paper is inspired by an \em integer linear programming (ILP) approach to learning t...
AbstractGiven an undirected graph G, a uniform cut polytope is defined as the convex hull of the inc...
. We study the combinatorial structure of the cut and metric polytopes on n nodes for n 5. Those t...
AbstractThe cut polytope Pc(G) of a graph G is the convex hull of the incidence vectors of all cuts ...
The max-cut problem and the associated cut polytope on complete graphs have been extensively studied...
In this paper we study the directed cut cone and polytope which are the positive hull and convex hul...
A cut in a graph G is the set of all edges between some set of vertices S and its complement S = V ...