Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H , each satisfying the following condition: the degree of each legal r−1-tuple contained in the complement of this side is strictly larger than n 2 . We prove that under this condition H must have a perfect matching. This answers a question of Kühn and Osthus.

We give a complete description of the set of triples (α, β, γ) of real numbers with the following property. There exists a constant K such that αn3 + βn2 + γn1 − K is a lower bound for the matching number ν(G) of every connected subcubic graph G, where ni denotes the number of vertices of degree i for each i.

We provide a formula for the number of edges of a maximum induced matching in a graph. As applications, we give some structural properties of (k + 1 )K2-free graphs, construct all 2K2-free graphs, and count the number of labeled 2K2-free connected bipartite graphs.

Aharoni and Berger conjectured that every collection of n matchings of size n+1 in a bipartite graph contains a rainbow matching of size n. This conjecture is related to several old conjectures of Ryser, Brualdi, and Stein about transversals in Latin squares. There have been many recent partial results about the Aharoni-Berger Conjecture. The conjecture is known to hold when the matchings are m...

This paper analyzes the use of a version of lexical maximim strategies, called protective behavior, in two-sided matching models. It restricts attention to mechanisms which produce stable matchings, that is, matchings which are individually rational and pairwise optimal. The main results of the paper show that truth-telling is the unique form of protective behavior in two such mechanisms. The f...

Pixel-by-pixel template matching is very time-consuming. For an input image of size N N × , and the template of size W W × , the computational complexity is O( 2 2 N W‧ ), given that the object orientations in both images are coincident. When we search an object with unknown orientation, the straightforward way to do template matching is to rotate the reference template in every possible orient...

We consider a finite population of agents who exchange information and are paired every period to play a game with tension between risk dominance and Pareto efficiency. Agents sample past plays and corresponding payoffs from their information neighborhood, and choose one of two possible actions using either best response or imitation. Information exchanges and possible matchings each constitute...

This paper introduces an XML Schema management platform that promotes the use of matching techniques to fulfill the requirements of data integration and data exchange. The existing platforms, in the market, deal only with graphical but not automatic matching. Several matching algorithms were suggested, by different researchers, to automate the correspondences discovery between XML Schemas. Thes...

ExpaRNA’s core algorithm computes, for two fixed RNA structures, a maximal non-overlapping set of maximal exact matchings. We introduce an algorithm ExpaRNA-P that solves the lifted problem of finding such sets of exact matchings in entire Boltzmann-distributed structure ensembles of two RNAs. Due to a novel kind of structural sparsification, the new algorithm maintains the time and space compl...

Given two sets A and B of n points each in R, we study the problem of computing a matching between A and B that minimizes the root mean square (rms) distance of matched pairs. We can compute an optimal matching in O(n2+δ) time, for any δ > 0, and an ε-approximation in time O((n/ε)3/2 log n). If the set B is allowed to move rigidly to minimize the rms distance, we can compute a rigid motion of B...