Complete minors in pseudorandom graphs

Random graphs have the smallest complete minors among all graphs of given order and density. We show that, unlike random graphs, many well‐known examples of pseudorandom graphs (such as Paley graphs) have very large minors. © 2000 John Wiley & Sons, Inc. Random Struct. Alg., 17: 26–28, 2000