The paper investigates conditions which guarantee the existence of a stable outcome in a school matching in the … to that school. We find that sufficient condition for a stable matching to exist is that a directed graph, which governs … polynomial time algorithm, which produces a stable matching. Furthermore, we show that if the graph has a cycle, then there exist …