R. Aharoni

collaborators

3 papers

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…

math.CO2024

Rainbow cycles for families of matchings

Ron Aharoni, He Guo

Given a graph $G$ and a coloring of its edges, a subgraph of $G$ is called rainbow if its edges have distinct colors. The rainbow girth of an edge coloring of G is the minimum leng…

math.CO2024

Looms

Ron Aharoni, Eli Berger, Joseph Briggs +2

A pair $(A, B)$ of hypergraphs is called orthogonal if $∣ a \cap b ∣ = 1$ for every pair of edges $a \in A$ and $b \in B$ . An orthogonal pair of hypergraphs is called a loom if each of…