|
|||||
|
|
A generalization of Tutte's 1-factor theorem to countable graphs |
|
| Authors: | Ron Aharoni |
| Institution: | Mathematics Department, Technion, Haifa, Israel |
| Abstract: | A criterion is proved for a countable graph to possess a perfect matching, in terms of “marriage” in bipartite graphs associated with the graph. In the finite case, this yields Tutte's 1-factor theorem. The criterion is conjectured to be valid for general graphs. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |