Daniel Kotlar

most citedA matroidal generalization of results of Drisko and Chappell

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

collaborators

5 papers

math.CO2017

Fair representation in the intersection of two matroids

Ron Aharoni, Eli Berger, Dani Kotlar +1

For a simplicial complex $C$ denote by $β (C)$ the minimal number of edges from $C$ needed to cover the ground set. If $C$ is a matroid t…

math.CO2016

Fair representation by independent sets

Ron Aharoni, Noga Alon, Eli Berger +4

For a hypergraph $H$ let $β (H)$ denote the minimal number of edges from $H$ covering $V (H)$ . An edge $S$ of $H$ is said to represent {\em fairly} (resp. {\em almost fairly}) a part…

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

On the Length of a Partial Independent Transversal in a Matroidal Latin Square

Daniel Kotlar, Ran Ziv

We suggest and explore a matroidal version of the Brualdi - Ryser conjecture about Latin squares. We prove that any $n \times n$ matrix, whose rows and columns are bases of a matroi…

math.CO2012

On extensions of the Alon-Tarsi Latin Square conjecture

Daniel Kotlar

Expressions involving the product of the permanent with the (n-1)th power of the determinant of a matrix of indeterminates, and of (0,1)-matrices, are shown to be related to two co…