“Hall's Theorem”的概念、定义、习题解题方法及翻译-数学辞典

单词

Hall's Theorem

释义

Hall's Theorem

(Hall's Marriage Theorem) Gives conditions for when a part of a bipartite graph has a matching. For a bipartite graph G with parts A and B, there is a matching for every element of A if and only if for every W ⊆ A it is the case that |W|≤|NG(W)|, where NG(W) denotes the neighbourhood of W.

随便看

数学辞典收录了4151条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。