D. Kotlar

activity

20112026

most citedDegree conditions for matchability in

3

-partite hypergraphs

3 citations · 10 across the 21 of their papers we have counts for

collaborators

Showing 2014 · math.COShow all

3 papers · 2 filters

math.CO2014

Distance magic labeling in complete 4-partite graphs

Dani Kotlar

Let $G$ be a complete $k$ -partite simple undirected graph with parts of sizes $p_{1} \leq p_{2} ... \leq p_{k}$ . Let $P_{j} = \sum_{i = 1}^{j} p_{i}$ for $j = 1, ..., k$ . It is conjectured that $G$ has dist…

math.CO2014★ 2 cited

A matroidal generalization of results of Drisko and Chappell

Daniel Kotlar, Ran Ziv

Let $M$ and $N$ be two matroids on the same ground set. We generalize results of Drisko and Chapell by showing that any $2 n - 1$ sets of size $n$ in $M \cap N$ have a rainbow set of…

math.CO2014★ 1 cited

Rainbow sets in the intersection of two matroids

Ron Aharoni, Daniel Kotlar, Ran Ziv

Given sets $F_{1}, \dots, F_{n}$ , a {\em partial rainbow function} is a partial choice function of the sets $F_{i}$ . A {\em partial rainbow set} is the range of a partial rainbow functi…