77 citations · 221 across the 23 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Cut dominants and forbidden minors
Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich
The cut dominant of a graph is the unbounded polyhedron whose points are all those that dominate some convex combination of proper cuts. Minimizing a nonnegative linear function ov…
cs.DM2015
Subgraph Polytopes and Independence Polytopes of Count Matroids
Michele Conforti, Volker Kaibel, Matthias Walter +1
Given an undirected graph, the non-empty subgraph polytope is the convex hull of the characteristic vectors of pairs (F, S) where S is a non-empty subset of nodes and F is a subset…