3 citations · 10 across the 21 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.CO2013
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…
math.CO2013
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…