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

Hall's conjecture

 Home Mathematics Fields of mathematics Number theory Unsolved problems in number theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
Hall's conjecture is a concept in combinatorics and graph theory, specifically related to the properties of perfect matchings in bipartite graphs. The conjecture states that a certain condition involving the size of subsets of one partition of a bipartite graph must hold for the graph to contain a perfect matching.

 Ancestors (5)

  1. Unsolved problems in number theory
  2. Number theory
  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