Statistical mechanics of bipartite z-matchings
نویسندگان
چکیده
منابع مشابه
Z-transformation graphs of maximum matchings of plane bipartite graphs
Let G be a plane bipartite graph. The Z-transformation graph Z(G) and its orientation Z̃(G) on the maximum matchings of G are de1ned. If G has a perfect matching, Z(G) and Z̃(G) are the usual Z-transformation graph and digraph. If G has neither isolated vertices nor perfect matching, then Z(G) is not connected. This paper mainly shows that some basic results for Z-transformation graph (digraph) o...
متن کاملEquilibrium statistical mechanics of bipartite spin systems
Aim of this paper is to give an extensive treatment of bipartite mean field spin systems, ordered and disordered: at first, bipartite ferromagnets are investigated, achieving an explicit expression for the free energy trough a new minimax variational principle. Furthermore via the Hamilton-Jacobi technique the same free energy structure is obtained together with the existence of its thermodynam...
متن کاملMatchings in colored bipartite networks
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n− r) blue edges for specified 0 ≤ r ≤ n, is a nontrivial integer program. We present an alternative, logically simpler proof of a theorem in [3] which establishes necessary and sufficient conditions for the existance of a solution...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملRainbow matchings in bipartite multigraphs
Suppose that k is a non-negative integer and a bipartite multigraph G is the union of N = ⌊ k + 2 k + 1 n ⌋ − (k + 1) matchings M1, . . . ,MN , each of size n. We show that G has a rainbow matching of size n− k, i.e. a matching of size n− k with all edges coming from different Mi’s. Several choices of parameters relate to known results and conjectures. Suppose that a multigraph G is given with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2019
ISSN: 1286-4854
DOI: 10.1209/0295-5075/126/28001