小白一个
求各位大神帮看看这个代码，求给定的一个图的所有最大匹配，总是出现：“No more memory available.Mathematica kernel has shut down.Try quitting other applications and then retry”，可是我的内存已经是32G了，是实验室的最大的了。
各位大神看这段代码可以优化吗，谢谢
g=Graph[{4<->7,4<->8,4<->25,4<->30,4<->23,4<->24,5<->26,5<->11,5<->12,
5<->13,5<->14,5<->27,6<->28,6<->17,6<->18,6<->19,6<->20,6<->29,7<->8,
8<->9,10<->11,11<->12,13<->14,14<->15,16<->17,17<->18,20<->19,20<->21,
22<->23,23<->24,31<->32,32<->33,34<->35,35<->36,37<->38,38<->39}]
esl=Select[Subsets[EdgeList[g],{12}],IndependentEdgeSetQ[g,#]&]
Length[esl]

Subsets[EdgeList[g], {12}]的列表长度为Binomial[36, 12]=1251677700，内存肯定不够的

Flatten /@
Tuples[Table[
Select[Subsets[EdgeList[h], {Length@FindIndependentEdgeSet[h]}],
IndependentEdgeSetQ[h, #] &], {h, ConnectedGraphComponents[g]}]]