3 citations · 10 across the 21 of their papers we have counts for
24 papers
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 such that and a partition , when…
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 of length is populated by the numbers , and the numbers…
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…
An infinite family of counterexamples to a conjecture on distance magic labeling
Ehab Ebrahem, Shlomo Hoory, Dani Kotlar
This work is about a partition problem which is an instance of the distance magic graph labeling problem. Given positive integers and such that…
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…
Computing autotopism groups of partial Latin rectangles: a pilot study
Rebecca J. Stones, Raúl M. Falcón, Daniel Kotlar +1
Computing the autotopism group of a partial Latin rectangle can be performed in a variety of ways. This pilot study has two aims: (a) to compare these methods experimentally, and (…
Fair representation in the intersection of two matroids
Ron Aharoni, Eli Berger, Dani Kotlar +1
For a simplicial complex denote by the minimal number of edges from needed to cover the ground set. If is a matroid t…
Fair representation by independent sets
Ron Aharoni, Noga Alon, Eli Berger +4
For a hypergraph let denote the minimal number of edges from covering . An edge of is said to represent {\em fairly} (resp. {\em almost fairly}) a part…
Degree conditions for matchability in -partite hypergraphs
Ron Aharoni, Eli Berger, Dani Kotlar +1
We study conjectures relating degree conditions in -partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particul…
On a conjecture of Stein
Ron Aharoni, Eli Berger, Dani Kotlar +1
Stein proposed the following conjecture: if the edge set of is partitioned into sets, each of size , then there is a partial rainbow matching of size . He pro…
Representation of large matchings in bipartite graphs
Ron Aharoni, Dani Kotlar, Ran Ziv
Let be the smallest number such that every collection of matchings, each of size at least , in a bipartite graph, has a full rainbow matching. Generalizing famous…
Uniqueness of the extreme cases in theorems of Drisko and Erdős-Ginzburg-Ziv
Ron Aharoni, Dani Kotlar, Ran Ziv
Drisko \cite{drisko} proved (essentially) that every family of matchings of size in a bipartite graph possesses a partial rainbow matching of size . In \cite{bgs} thi…
Decomposition of bi-colored square arrays into balanced diagonals
Dani Kotlar, Ran Ziv
Given an array (), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of int…
Distance magic labeling in complete 4-partite graphs
Dani Kotlar
Let be a complete -partite simple undirected graph with parts of sizes . Let for . It is conjectured that has dist…
A matroidal generalization of results of Drisko and Chappell
Daniel Kotlar, Ran Ziv
Let and be two matroids on the same ground set. We generalize results of Drisko and Chapell by showing that any sets of size in have a rainbow set of…
Rainbow sets in the intersection of two matroids
Ron Aharoni, Daniel Kotlar, Ran Ziv
Given sets , a {\em partial rainbow function} is a partial choice function of the sets . A {\em partial rainbow set} is the range of a partial rainbow functi…
Large matchings in bipartite graphs have a rainbow matching
Daniel Kotlar, Ran Ziv
Let be the least number such that every collection of matchings, each of size at least , in a bipartite graph, has a full rainbow matching. Aharoni and Berger \cit…
Computing the autotopy group of a Latin square by cycle structure
Daniel Kotlar
An algorithm that uses the cycle structure of the rows, or the columns, of a Latin square to compute its autotopy group is introduced. As a result, a bound for the size of the auto…
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 matrix, whose rows and columns are bases of a matroi…
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…
Parity Types, Cycle Structures and Autotopisms of Latin Squares
Daniel Kotlar
The parity type of a Latin square is defined in terms of the numbers of even and odd rows and columns. It is related to an Alon-Tarsi-like conjecture that applies to Latin squares…
A Characterization of Binary Matroids by Basis-Exchange
Daniel Kotlar
The effect of replacing a basis element on the way the basis spans other elements is studied. This leads to a new characterization of binary matroids.
On circuits and serial symmetric basis-exchange in matroids
Daniel Kotlar
The way circuits, relative to a basis, are affected as a result of exchanging a basis element, is studied. As consequences, it is shown that three consecutive symmetric exchanges e…
On Serial Symmetric Exchanges of Matroid Bases
Daniel Kotlar, Ran Ziv
We study some properties of a serial (i.e. one-by-one) symmetric exchange of elements of two disjoint bases of a matroid. We show that any two elements of one base have a serial sy…