> Merkliste Sie können Bookmarks mittels Listen verwalten, loggen Sie sich dafür bitte in Ihr SLUB Benutzerkonto ein.
Medientyp: E-Artikel Titel: Quasi‐random graphs with given degree sequences Beteiligte: Chung, Fan; Graham, Ron Erschienen: Wiley, 2008 Erschienen in: Random Structures & Algorithms Sprache: Englisch DOI: 10.1002/rsa.20188 ISSN: 1042-9832; 1098-2418 Schlagwörter: Applied Mathematics ; Computer Graphics and Computer-Aided Design ; General Mathematics ; Software Entstehung: Anmerkungen: Beschreibung: <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>