Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Graphs of Stably Matchable Pairs   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.

22
The categories of this paper are: chao-dyn
36
The categories of this paper are: cmp-lg
34
The categories of this paper are: chem-ph
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
3
The categories of this paper are: physics
17
The categories of this paper are: q-fin
9
The categories of this paper are: nlin
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
29
The categories of this paper are: funct-an
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
26
The categories of this paper are: bayes-an
0
The categories of this paper are: hep-ph