7 papers
Testing the max-flow min-cut property and the replication conjecture
Ahmad Abdi, Tamás Schwarcz
The replication conjecture [Conforti and Cornuéjols, 1993] states that every clutter with the packing property has the MFMC property. If true, this conjecture would have far-reachi…
Cosigning Crossing Families and Outer-Planar Gadgets
Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner
Let be a crossing family over ground set , that is, for any two sets with nonempty intersection and proper union, both sets are in . Let $…
The rainbow covering number of clean tangled clutters
Ahmad Abdi, Gérard Cornuéjols
In this brief note, we prove a min-min equality for a clean tangled clutter, that the rainbow covering number is equal to the connectivity of its setcore.
Integral bases, perfect matchings, and the Petersen graph
Ahmad Abdi, Olha Silina
Let be a matching-covered graph, denote by its perfect matching polytope, and by the integer lattice generated by the integral points in . In this paper, we gi…
Lower bounds for cube-ideal set-systems
Ahmad Abdi, Gérard Cornuéjols, Daniel Dadush +1
A set-system is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, co…
Strong orientation of a connected graph for a crossing family
Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner
Given a connected graph and a crossing family over ground set such that for every , we prove there exists a strong or…
Strongly connected orientations and integer lattices
Ahmad Abdi, Gérard Cornuéjols, Siyue Liu +1
Let be a digraph whose underlying undirected graph is -edge-connected, and let be the polytope whose vertices are the incidence vectors of arc sets whose reversal…