We study outcome of two-sided matching between prospective medical residents who can only apply to a limited number of positions and hospitals who can interview only a limited number of applicants and show non-intuitive effects in the matching outcomes. We study matching size as our notion of efficiency, and show when the number of interviews is limited, a market with limited number of applicat...

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M , such that S is contained in no other perfect matching of G. This notion originally arose in chemistry in the study of molecular resonance structures. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the...

In pattern matching with character classes the goal is to find all occurrences of a pattern of length m in a text of length n, where each pattern position consists of an allowed set of characters from a finite alphabet Σ. We present an FFT-based algorithm that uses a novel prime-numbers encoding scheme, which is log n/ log m times faster than the fastest extant approaches, which are based on bo...

Two studies examined the role of conventional number knowledge on young children’s nonverbal number matching (NVM). We hypothesized that acquiring two number words (”one” and ”two”) would facilitate children’s performance on the NVM task by highlighting numerical comparisons rather than comparisons based on other variables. To test this hypothesis, twoand three-year-olds were given a NVM task t...

The aim of the present paper is to prove that the maximum number of edges in a 3-uniform hypergraph on n vertices and matching number s is max {(3s+ 2 3 ) , ( n 3 ) − ( n− s 3 )} for all n, s, n ≥ 3s+ 2.

In this paper, we show that of all graphs of order n with matching number β, the graphs with maximal spectral radius are Kn if n = 2β or 2β + 1; K2β+1 ∪Kn−2β−1 if 2β + 2 n < 3β + 2; Kβ ∨ Kn−β or K2β+1 ∪Kn−2β−1 if n = 3β + 2; Kβ ∨ Kn−β if n > 3β + 2, where Kt is the empty graph on t vertices. © 2006 Elsevier Inc. All rights reserved. AMS classification: 05C35; 05C50

To increase the efficiency of interest-point based object retrieval, researchers have put remarkable research efforts into improving the efficiency of kNN-based feature matching, pursuing to match thousands of features against a database within fractions of a second. However, due to the high-dimensional nature of image features that reduces the effectivity of index structures (curse of dimensio...

Despite the large amount of work devoted in recent years to the problem of non-rigid shape matching, practical methods that can successfully be used for arbitrary pairs of shapes remain elusive. In this paper, we study the hardness of the problem of shape matching, and introduce the notion of the shape condition number, which captures the intuition that some shapes are inherently more difficult...

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.