DeepAI AI Chat
Log In Sign Up

The Graphs of Stably Matchable Pairs

by   David Eppstein, et al.

We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing these graphs, an exact recognition algorithm that is singly exponential in the number of edges of the given graph, and an algorithm whose time is linear in the number of vertices of the graph but exponential in a polynomial of its carving width. We also provide characterizations of graphs of stably matchable pairs that belong to certain classes of graphs, and of the lattices of stable matchings that can have graphs in these classes.


page 1

page 2

page 3

page 4


A note on Matching-Cut in P_t-free Graphs

A matching-cut of a graph is an edge cut that is a matching. The problem...

Adapting Stable Matchings to Forced and Forbidden Pairs

We introduce the problem of adapting a stable matching to forced and for...

Sequence pairs related to produced graphs from a method for dividing a natural number by two

This paper is about producing a new kind of the pairs which we call it M...

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width

In this paper, we provide polynomial-time algorithms for different exten...

Characterization of Super-stable Matchings

An instance of the super-stable matching problem with incomplete lists a...

GraphMaps: Browsing Large Graphs as Interactive Maps

Algorithms for laying out large graphs have seen significant progress in...

Locally EFX Allocations Over a Graph

The fairness notion of envy-free up to any good (EFX) has recently gaine...