Search
Now showing items 891-892 of 892
Probabilistic and extremal behavior in graphs and matrices
(Massachusetts Institute of Technology, 2020)
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 ...
Partially ordered sets with hooklengths : an algorithmic approach.
(Massachusetts Institute of Technology, 1979)