Form a bipartite graph with left labels , right set , and an edge exactly when . A matching covering all left labels is precisely a choice of distinct representatives. Its neighborhood condition is
(1)
Thus this is necessary and sufficient. The underlying set may be infinite; only the number of sets to be represented is finite.

Ancestors (13)

  1. iii
  2. R2
  3. R
  4. 2009
  5. Past exam of the Probability, statistics and options II course of the University of Oxford
  6. Probability, statistics and options II course of the University of Oxford
  7. Year 2 of the mathematics and statistics course of the University of Oxford
  8. Mathematics and statistics course of the University of Oxford
  9. Undergraduate course of the University of Oxford
  10. Course of the University of Oxford
  11. University of Oxford
  12. List of universities
  13. 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