Gérard Cornuéjols

collaborators

3 papers

math.CO2025

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.

math.CO2025

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.CO2024

Strongly connected orientations and integer lattices

Ahmad Abdi, Gérard Cornuéjols, Siyue Liu +1

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…