Add to ORKGWe consider matchings with diametral disks between two sets of points R and B. More precisely, for each pair of matched points p ¿ R and q ¿ B, we consider the disk through p and q with the smallest diameter. We prove that for any R and B such that |R| = |B|, there exists a perfect matching such that the diametral disks of the matched point pairs have a common intersection. In fact, our result is stronger, and shows that a maximum weight perfect matching has this property
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
Let $m_d(k,n)$ be the minimal $m$ such that every $k$-uniform hypergraph on $n$ vertices and with mi...
Abstract In memory of our friend, Ferran Hurtado. Given a set S = {R 1 , R 2 , . . . , R 2n } of 2n ...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
We consider matchings between a set R of red points and a set B of blue points with diametral disks....
Huemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the ...
AbstractThis paper studies non-crossing geometric perfect matchings. Two such perfect matchings are ...
For a set R of n red points and a set B of n blue points, a BR-matching is a non-crossing geometric ...
This paper is accepted for publication in ALGORITHMICA Let A and B be two sets of n objects in Rd, a...
Abstract. Given a class C of geometric objects and a point set P,aCmatching of P is a set M = {C1,.....
We consider the Euclidean 2-center problem for a set of n disks in the plane: find two smallest cong...
Consider the family of all perfect matchings of the complete graph K2n with 2n vertices. Given any c...
Let Bn be the binary de Bruijn digraph of order n andW the quotient set of the set of vertices of B...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
Let S be a point set in the plane such that each of its elements is colored either red or blue. A ma...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
Let $m_d(k,n)$ be the minimal $m$ such that every $k$-uniform hypergraph on $n$ vertices and with mi...
Abstract In memory of our friend, Ferran Hurtado. Given a set S = {R 1 , R 2 , . . . , R 2n } of 2n ...
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativec...
We consider matchings between a set R of red points and a set B of blue points with diametral disks....
Huemer et al. (Discrete Math., 2019) proved that for any two point sets R and B with |R| = |B|, the ...
AbstractThis paper studies non-crossing geometric perfect matchings. Two such perfect matchings are ...
For a set R of n red points and a set B of n blue points, a BR-matching is a non-crossing geometric ...
This paper is accepted for publication in ALGORITHMICA Let A and B be two sets of n objects in Rd, a...
Abstract. Given a class C of geometric objects and a point set P,aCmatching of P is a set M = {C1,.....
We consider the Euclidean 2-center problem for a set of n disks in the plane: find two smallest cong...
Consider the family of all perfect matchings of the complete graph K2n with 2n vertices. Given any c...
Let Bn be the binary de Bruijn digraph of order n andW the quotient set of the set of vertices of B...
A matching of a graph is a subset of the edges of that graph, such that no two edges in the matching...
Let S be a point set in the plane such that each of its elements is colored either red or blue. A ma...
AbstractIn this paper we study degree conditions which guarantee the existence of perfect matchings ...
Let $m_d(k,n)$ be the minimal $m$ such that every $k$-uniform hypergraph on $n$ vertices and with mi...
Abstract In memory of our friend, Ferran Hurtado. Given a set S = {R 1 , R 2 , . . . , R 2n } of 2n ...