推 Eeon :cf. An introduction to graph theory, second 12/02 02:03
→ Eeon :edition, by Douglas B. West page 139 12/02 02:03
→ simplemath :有其他種解法嗎?? 12/02 02:15
Corollary. (Berge-Tutte Formula-Berge [1958]) The largest number
of vertices saturated by a matching in G is min s是V(G)的子集合{n(G)- d(S)},
where
d(S) = o(G- S)- lSl.
這試圖論的題目~我不知道該怎麼做~希望有高手能幫幫忙~多謝各位大大
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 111.184.218.36