P. F. Reichmeider, The Equivalence of Some Combinatorial Matching Theorems (Polygonal Pub., 1984).  Home/Search   Document Not in Database   Summary   Related Articles

....a Markov kernel. Note that if P = hA [ B; OEi, where OE A Theta B (and A B = and if G is the integers and j(a) 1 for each a 2 A while (b) 1 for each b 2 B, then we get Hall s Marriage Theorem [Hal35] If we let j and be any integral values, we get a theorem of Hoffman [Ho60] see [Re84]. If we let G be the reals, we get the finite version of the theorem of Strassen [St65] KamKO77] or Major [LoP86, p. 76] If G is Q[ p 5] we get a funny beast indeed. Note that if we got Theorem 3.1 such for bipartite orders, the whole result follows immediately. Proof: First, suppose ....

P. F. Reichmeider, The Equivalence of Some Combinatorial Matching Theorems (Polygonal Pub., 1984).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC