The talk will concern a category having directed graphs as objects, and morphisms that can be used to model resource availability. This has applications in modeling the "mapping problem" in parallel processing, and in other situations involving modeling of resource availability. The talk will survey what is known about this category, and a number of elegant open problems that are well-known to the graph theory community and apparently difficult. It may be that homological methods could help to settle these.