论文信息 - Matchings in graphs of size N1 - 字舞流文

Matchings in graphs of size N1

Abstract A criterion is proved for a graph of size ℵ 1 or less to possess a perfect matching.

[1] Ron Aharoni. On an obstruction for perfect matchings , 1984, Comb..

[2] K. Steffens. Matchings in countable graphs , 1977 .