Matchings in random regular bipartite digraphsDavid W. WalkupDiscrete Mathematics1980Let G be a random directed bipartite graph with n nodes in each class and outward degree d at each node. The probability G contains a niatching is shown to approach one for large n if d 3 2, but toâ€¦ (More)

A Note on Decision Rules for Stochastic ProgramsRoger J.-B. Wets, David W. WalkupJ. Comput. Syst. Sci.1968

How many ways can a permutation be factored into two n-cycles?David W. WalkupDiscrete Mathematics1979