Zobrazeno 1 - 10
of 158
pro vyhledávání: '"Ziv Ran"'
Entity Matching is an essential part of all real-world systems that take in structured and unstructured data coming from different sources. Typically no common key is available for connecting records. Massive data cleaning and integration processes r
Externí odkaz:
http://arxiv.org/abs/2201.04687
For a simplicial complex ${\mathcal C}$ denote by $\beta({\mathcal C})$ the minimal number of edges from ${\mathcal C}$ needed to cover the ground set. If ${\mathcal C}$ is a matroid then for every partition $A_1, \ldots, A_m$ of the ground set there
Externí odkaz:
http://arxiv.org/abs/1612.07652
Autor:
Aharoni, Ron, Alon, Noga, Berger, Eli, Chudnovsky, Maria, Kotlar, Dani, Loebl, Martin, Ziv, Ran
For a hypergraph $H$ let $\beta(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 partition $(V_1,V_2, \ldots, V_m)$ of $V(H)$ if $|S\cap V_i|\ge \lfloo
Externí odkaz:
http://arxiv.org/abs/1611.03196
We study conjectures relating degree conditions in $3$-partite hypergraphs to the matching number of the hypergraph, and use topological methods to prove special cases. In particular, we prove a strong version of a theorem of Drisko \cite{drisko} (as
Externí odkaz:
http://arxiv.org/abs/1605.05667
Stein proposed the following conjecture: if the edge set of $K_{n,n}$ is partitioned into $n$ sets, each of size $n$, then there is a partial rainbow matching of size $n-1$. He proved that there is a partial rainbow matching of size $n(1-\frac{D_n}{n
Externí odkaz:
http://arxiv.org/abs/1605.01982
Let $f(n)$ be the smallest number such that every collection of $n$ matchings, each of size at least $f(n)$, in a bipartite graph, has a full rainbow matching. Generalizing famous conjectures of Ryser, Brualdi and Stein, Aharoni and Berger conjecture
Externí odkaz:
http://arxiv.org/abs/1601.00943
Drisko \cite{drisko} proved (essentially) that every family of $2n-1$ matchings of size $n$ in a bipartite graph possesses a partial rainbow matching of size $n$. In \cite{bgs} this was generalized as follows: Any $\lfloor \frac{k+2}{k+1} n \rfloor -
Externí odkaz:
http://arxiv.org/abs/1511.05775
Autor:
Kotlar, Dani, Ziv, Ran
Given an $n\times n$ array $M$ ($n\ge 7$), where each cell is colored in one of two colors, we give a necessary and sufficient condition for the existence of a partition of $M$ into $n$ diagonals, each containing at least one cell of each color. As a
Externí odkaz:
http://arxiv.org/abs/1508.03751
Autor:
Kotlar, Daniel, Ziv, Ran
Let $M$ and $N$ be two matroids on the same ground set. We generalize results of Drisko and Chapell by showing that any $2n-1$ sets of size $n$ in $M \cap N$ have a rainbow set of size $n$ in $M \cap N$.
Externí odkaz:
http://arxiv.org/abs/1407.7321
Given sets $F_1, \ldots ,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 function. Aharoni and Berger \cite{AhBer} conjectured that if $M$ and $N$ ar
Externí odkaz:
http://arxiv.org/abs/1405.3119