4 citations · 17 across the 24 of their papers we have counts for
28 papers
Global and local degree conditions for matchability
Ron Aharoni, Eli Berger, Attila Joó
A corollary of Hall's marriage theorem is that a sufficient condition for a list of sets to have a system of distinct representatives is that $|V_i|\ge deg_{\{…
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…
When all directed cycles have the same weight
Eli Berger, Daniel Carter, Paul Seymour
A digraph 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…
A common generalization to strengthenings of Drisko's Theorem for intersections of two matroids
Eli Berger, Daniel McGinnis
Let and be two matroids on the same ground set . Let be sets which are independent in both and , sati…
2-covers of wide Young diagrams
Ron Aharoni, Eli Berger, He Guo +1
A Young diagram is called wide if every sub-diagram formed by a subset of the rows of dominates , the conjugate of . A Young diagram is called Latin if its s…
Bounded diameter tree-decompositions
Eli Berger, Paul Seymour
When does a graph admit a tree-decomposition in which every bag has small diameter? For finite graphs, this is a property of interest in algorithmic graph theory, where it is calle…