OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Kanamori–McAloon theorem

 Home Mathematics Fields of mathematics Foundations of mathematics Theorems in the foundations of mathematics
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Kanamori–McAloon theorem is a result in the field of combinatorial optimization and discrete mathematics, particularly related to the study of perfect matchings in bipartite graphs. It is named after researchers Yoshihiro Kanamori and Jim McAloon. While the specific theorem may not be universally recognized or widely published under that name, it typically pertains to conditions under which certain structured forms of bipartite graphs possess perfect matchings.

 Ancestors (5)

  1. Theorems in the foundations of mathematics
  2. Foundations of mathematics
  3. Fields of mathematics
  4. Mathematics
  5.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook