- CEMC Home
- Mathematics and Computing Contests
- Master of Mathematics
- Web Resources
- Face-to-Face Workshops
- Order Books
- Sponsors and Donors
- About Us
How can suitable kidney donors be found for patients in need?
Being Solved by Mathematicians
Suppose you need a kidney transplant and your brother Arnold offers to donate one of his kidneys to you. You discover that since your blood type is O his blood type is A, your body would reject his kidney.
Another patient, Sheldon, also needs a kidney. His wife Ann had hoped to donate a kidney to Sheldon, but his blood type is A and her blood type is O. Ann agrees to donate a kidney to you on the condition that your brother Arnold donates a kidney to Sheldon – and in both cases the kidneys are compatible. Especially for rare blood types, this kind of Paired Kidney Donation can save lives by matching willing, compatible kidney donors to patients in need.
|Organizations keep a database of donor/recipient teams hoping for a Paired Kidney Donation. Ontario has over one thousand patients awaiting kidney transplant. Mathematicians use Graph Theory techniques to match the maximum number of compatible teams for Paired Kidney Donation, saving as many lives as possible.|
How many lives can you save? The graph shows which donor/recipient teams are compatible for a Paired Kidney Donation.
Can you find the match the maximum number of teams for Paired Kidney Donation?
|Back to full list of problems|