Ahmad Abdi

activity

20242026

collaborators

7 papers

math.OC2026

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-reach…

math.CO2026

Integral bases, perfect matchings, and the Petersen graph

Ahmad Abdi, Olha Silina

Let $G = (V, E)$ be a matching-covered graph, denote by $P$ its perfect matching polytope, and by $L$ the integer lattice generated by the integral points in $P$ . In this paper, we gi…

math.CO2026

Lower bounds for cube-ideal set-systems

Ahmad Abdi, GÃ©rard CornuÃ©jols, Daniel Dadush +1

A set-system $S \subseteq {0, 1}^{n}$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, co…

math.CO2026

Cosigning Crossing Families and Outer-Planar Gadgets

Ahmad Abdi, Mahsa Dalirrooyfard, Meike Neuwohner

Let $F$ be a crossing family over ground set $V$ , that is, for any two sets $U, W \in F$ with nonempty intersection and proper union, both sets $U \cap W, U \cup W$ are in $F$ . Let $…

math.CO2026

Strongly connected orientations and integer lattices

Let $D = (V, A)$ be a digraph whose underlying undirected graph is $2$ -edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal…

math.CO2025

The rainbow covering number of clean tangled clutters

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.