MIT Libraries homeDSpace@MIT

This thesis deals with several related questions in probabilistic and extremal graph theory and discrete random matrix theory. First, for any bipartite graph H containing a cycle, we prove an upper bound of [mathematical ...