D. Kotlar

collaborators

4 papers

math.CO2026

Solvable and unsolvable instances of the equal sum partition problem

Shlomo Hoory, Dani Kotlar

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n, k \in N$ such that $k ∣ \sum_{i = 1}^{n} i$ and a partition $p_{1} + \dots + p_{k} = n$ , when…

math.CO2025

Outline Rectangles, Allocations, and Latin Young Diagrams

Jack Allsop, Daniel Kotlar, Ian Wanless

A Young diagram is \emph{Latin} if there is an assignment of integers to its cells so that each row $i$ of length $l_{i}$ is populated by the numbers $1, \dots, l_{i}$ , and the numbers…

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

Coloring, list coloring, and fractional coloring in intersections of matroids

Ron Aharoni, Eli Berger, He Guo +1

It is known that in matroids the difference between the chromatic number and the fractional chromatic number is smaller than 1, and that the list chromatic number is equal to the c…