Extending Hall's theorem into list colorings: a partial history (Q925374): Difference between revisions

Summary: In 1988, \textit{A. J. W. Hilton} and \textit{P. D. Johnson jun.} [in: Graph colourings, Proc. Conf., Milton Keynes/UK 1988, Pitman Res. Notes Math. Ser. 218, 135--143 (1990; Zbl 0693.05034); in:Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 359--371 (1990; Zbl 0731.05017)] found a natural generalization of the condition in Philip Hall's celebrated theorem on systems of distinct representatives. This generalization was formed in the relatively new theory of list colorings of graphs. Here we give an account of a strand of development arising from this generalization, concentrating on extensions of Hall's theorem. New results are presented concerning list colorings of independence systems and colorings of graphs with nonnegative measurable functions on positive measure spaces.