Before revision:  The goal is to have a single pass over the stream, use O(n polylog n ) space, and output a large matching of G. We prove that for an absolute constant \epsilon_0 > 0, one can find a (2/3 + \epsilon_0)-approximate maximum matching of G using O(n \log n) space with high probability.
After revision:  The goal is to have a single pass over the stream, use n \cdot poly(\log n ) space, and output a large matching of G. We prove that for an absolute constant \epsilon_0 > 0, one can find a (2/3 + \epsilon_0)-approximate maximum matching of G using O(n \log n) space with high probability.