AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. The criterion is used to prove an extension of Tutte's 1-factor theorem for general graphs
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particul...
AbstractA criterion is proved for a countable graph to possess a perfect matching, in terms of “marr...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractA criterion is proved for a countable graph to possess a perfect matching, in terms of “marr...
AbstractA criterion is proved for a graph of size ℵ1 or less to possess a perfect matching
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractF. Bry (J. Combin. Theory Ser. B 34 (1983), 48–57) proved that a locally finite infinite n-c...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinit...
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinit...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particul...
AbstractA criterion is proved for a countable graph to possess a perfect matching, in terms of “marr...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractA criterion is proved for a countable graph to possess a perfect matching, in terms of “marr...
AbstractA criterion is proved for a graph of size ℵ1 or less to possess a perfect matching
AbstractTutte's theorem on perfect matchings is considered from the viewpoint of the Marriage Proble...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractWe prove that the perfect matching for regular graphs (even if restricted to degree 3 and 2-...
AbstractF. Bry (J. Combin. Theory Ser. B 34 (1983), 48–57) proved that a locally finite infinite n-c...
AbstractGallai and Edmonds independently obtained a canonical decomposition of graphs in terms of th...
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinit...
AbstractWe give a new proof of Aharoni′s criterion for the existence of perfect matchings in infinit...
AbstractA graph G satisfies the neighborhood condition ANC(G) ⩾ m if, for all pairs of vertices of G...
AbstractIn this paper a generalization of the factor problem for finite undirected graphs is detaile...
We characterize hyperfinite bipartite graphings that admit measurable perfect matchings. In particul...
DOI
Add to ORKG