Eli Berger

collaborators

4 papers

math.CO2026

A sharp bound on the integrality gap in the 3-set cover problem

Eli Berger, Ron Holzman

Given a hypergraph with edges of size at most 3, the 3-set cover problem asks to determine the minimum size of a family of edges which covers the vertex set. As the problem is NP-h…

math.CO2026

When all directed cycles have the same weight

Eli Berger, Daniel Carter, Paul Seymour

A digraph $G$ is weightable if its edges can be weighted with real numbers such that the total weight in each directed cycle equals 1. There are several equivalent conditions: that…

math.CO2025

A common generalization to strengthenings of Drisko's Theorem for intersections of two matroids

Eli Berger, Daniel McGinnis

Let $M$ and $N$ be two matroids on the same ground set $V$ . Let $A_{1}, \dots, A_{2 n - 1}$ be sets which are independent in both $M$ and $N$ , sati…

math.CO2025

2-covers of wide Young diagrams

Ron Aharoni, Eli Berger, He Guo +1

A Young diagram $Y$ is called wide if every sub-diagram $Z$ formed by a subset of the rows of $Y$ dominates $Z^{'}$ , the conjugate of $Z$ . A Young diagram $Y$ is called Latin if its s…