AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special attention to the duality between matchings and covers. Some results are presented which have not appeared elsewhere, mainly concerning Menger's theorem for infinite graphs
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
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...
In any bipartite graph (possibly infinite) there exist a matching N and a cover P such that P consis...
This book surveys matching theory, with an emphasis on connections with other areas of mathematics a...
AbstractIn any graph there exist a fractional cover and a fractional matching satisfying the complem...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractA graph is called matching covered if for its every edge there is a maximum matching contain...
This study of matching theory deals with bipartite matching, network flows, and presents fundamental...
Matching theory is a core topic of both applied and theoretical graph theory, which is full of elega...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
AbstractWe survey the existing theory of matchings in infinite graphs and hypergraphs, with special ...
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...
In any bipartite graph (possibly infinite) there exist a matching N and a cover P such that P consis...
This book surveys matching theory, with an emphasis on connections with other areas of mathematics a...
AbstractIn any graph there exist a fractional cover and a fractional matching satisfying the complem...
AbstractA general criterion is proved for a graph of any cardinality to possess a perfect matching. ...
AbstractProofs are given of theorems of Lovász and Brualdi on the existence in a finite simple graph...
AbstractA graph is called matching covered if for its every edge there is a maximum matching contain...
This study of matching theory deals with bipartite matching, network flows, and presents fundamental...
Matching theory is a core topic of both applied and theoretical graph theory, which is full of elega...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
International audienceElek and Lippner (Proc. Am. Math. Soc. 138(8), 2939-2947, 2010) showed that th...
DOI
Add to ORKG