48 citations · 118 across the 36 of their papers we have counts for
45 papers
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…
Looms
Ron Aharoni, Eli Berger, Joseph Briggs +2
A pair of hypergraphs is called orthogonal if for every pair of edges and . An orthogonal pair of hypergraphs is called a loom if each of…
Tight infinite matrices
Ron Aharoni, He Guo
We give a simple proof of a recent result of Gollin and Joó: if a possibly infinite system of homogeneous linear equations , where is an $I \ti…
Strongly maximal matchings and strongly minimal covers
Ron Aharoni
This is a not-to-be-journal-published paper, aimed to serve as reference. It is a summary of the main ideas on the topic appearing in the title, and an opportunity to state correct…
Rainbow cycles for families of matchings
Ron Aharoni, He Guo
Given a graph and a coloring of its edges, a subgraph of is called rainbow if its edges have distinct colors. The rainbow girth of an edge coloring of G is the minimum leng…
Non-uniform degrees and rainbow versions of the Caccetta-Häggkvist conjecture
Ron Aharoni, Eli Berger, Maria Chudnovsky +2
The Caccetta-Häggkvist conjecture (denoted below CHC) states that the directed girth (the smallest length of a directed cycle) of a directed graph on vertices i…