Last Updated:2025/11/22

The matching number of this bipartite graph equals the size of a minimum vertex cover by König's theorem.

See correct answer

The matching number of this bipartite graph equals the size of a minimum vertex cover by König's theorem.

音声機能が動作しない場合はこちらをご確認ください
Edit Histories(0)
Source Sentence

この二部グラフの最大マッチングの辺の数は、ケーニッヒの定理により最小頂点被覆のサイズに等しい。

Sentence quizzes to help you learn to read

Edit Histories(0)

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★