Media type: E-Article Title: Quasi‐random graphs with given degree sequences Contributor: Chung, Fan; Graham, Ron imprint: Wiley, 2008 Published in: Random Structures & Algorithms Language: English DOI: 10.1002/rsa.20188 ISSN: 1042-9832; 1098-2418 Keywords: Applied Mathematics ; Computer Graphics and Computer-Aided Design ; General Mathematics ; Software Origination: Footnote: Description: <jats:title>Abstract</jats:title><jats:p>It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of necessity possess them all. These properties, termed quasirandom, have been described for a variety of structures such as graphs, hypergraphs, tournaments, Boolean functions, and subsets of <jats:bold><jats:italic>Z</jats:italic></jats:bold><jats:sub><jats:italic>n</jats:italic></jats:sub>, and most recently, sparse graphs. In this article, we extend these ideas to the more complex case of graphs which have a given degree sequence. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008</jats:p>