a module m is called epi-retractable if every submodule of m is a homomorphic image of m. dually, a module m is called co-epi-retractable if it contains a copy of each of its factor modules. in special case, a ring r is called co-pli (resp. co-pri) if rr (resp. rr) is co-epi-retractable. it is proved that if r is a left principal right duo ring, then every left ideal of r is an epi-retractable ...

We design and implement an efficient parallel approximation algorithm for the problem of maximum weight perfect matching in bipartite graphs, i.e. the problem of finding a set of non-adjacent edges that covers all vertices and has maximum weight. This problem differs from the maximum weight matching problem, for which scalable approximation algorithms are known. It is primarily motivated by fin...

We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A graph parameter is said to be estimable if it converges along every Benjamini– Schramm convergent sparse graph sequence. We prove that the normalized logarithm o...

The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle. We prove that the matching graph M(Qd) of the d-dimensional hypercube is bipartite and connected for d ≥ 4. This proves Kreweras’ conjecture [2] that the graph Md is connected, where Md is obtai...

Let R be an associative ring with identity, C(R) be the category of com-plexes of R-modules and Flat(C(R)) be the class of all at complexes of R-modules. We show that the at cotorsion theory (Flat(C(R)); Flat(C(R))−)have enough injectives in C(R). As an application, we prove that for each atcomplex F and each complex Y of R-modules, Exti (F,X)= 0, whenever Ris n-perfect and i > n.

A minimal blocker in a bipartite graph G is a minimal set of edges the removal of which leaves no perfect matching in G. We give an explicit characterization of the minimal blockers of a bipartite graph G. This result allows us to obtain a polynomial delay algorithm for finding all minimal blockers of a given bipartite graph. Equivalently, this gives a polynomial delay algorithm for listing the...