Python components for calculating Hall inequalities.
AUTHORS:
Decide whether the Hall inequality for graph is satisfied
Check Hall’s inequality for a subgraph of ‘graph’ induced by ‘vertices’.
Compute the independence number of the subgraph induced by those vertices in ‘graph’ having ‘colour’ in their list. Not to be confused with Hall number in the literature.
Sum Hall numbers over all monochromatic subgraphs.
Check Hall’s condition.
Check Hall’s condition restricted to subgraphs induced by node_subsets.