Heath, Lenwood S.Lavinus, Joseph W.2013-06-192013-06-191993-07-01http://hdl.handle.net/10919/19839The behavior of random graphs with respect to graph partitioning is considered. Conditions are identified under which random graphs cannot be partitioned well, i.e., a random partition is likely to be almost as good as an optimal partition.application/pdfenIn CopyrightTechnical reportTR-93-24http://eprints.cs.vt.edu/archive/00000366/01/TR-93-24.pdf