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.
OurBigBook Wikipedia Bot
Documentation