Last Updated :2025/11/22

matching number

Noun
Japanese Meaning
グラフ理論において、最大マッチング(最大独立辺集合)に含まれる辺の数。 / グラフ G において、最も多くの辺を含むマッチングの辺の個数。
What is this buttons?

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

plural

Quizzes for review

(graph theory) the number of edges in a maximum matching, often denoted 𝜈=𝜈(G)

音声機能が動作しない場合はこちらをご確認ください
See correct answer

matching number

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.

音声機能が動作しない場合はこちらをご確認ください

English - English

Word Edit Setting
  • Users who have edit permission for words - All Users
  • Screen new word creation
  • Screen word edits
  • Screen word deletion
  • Screen the creation of new headword that may be duplicates
  • Screen changing entry name
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Sentence Edit Setting
  • Users who have edit permission for sentences - All Users
  • Screen sentence deletion
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Quiz Edit Setting
  • Users who have edit permission for quizzes - All Users
  • Users authorized to vote on judging - Editor
  • Number of votes required for decision - 1
Editing Guideline

Login / Sign up

 

Download the app!
DiQt

DiQt

Free

★★★★★★★★★★