Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Subgraphs of random graphs with specified degrees

Thumbnail Image

Date

2010

Authors

McKay, Brendan

Journal Title

Journal ISSN

Volume Title

Publisher

Conference Organising Committee

Abstract

If a graph is chosen uniformly at random from all the graphs with a given degree sequence, what can be said about its subgraphs? The same can be asked of bipartite graphs, equivalently 0-1 matrices. These questions have been studied by many people. In thi

Description

Keywords

Keywords: 0-1 matrices; Bipartite graphs; Degree sequence; Random graphs; Regular graphs; Saddlepoint method; Subgraphs; Vertex degree; Graph theory Random graphs; Regular graph; Subgraph; Vertex degree

Citation

URI

http://hdl.handle.net/1885/83999

Collections

ANU Research Publications

Source

Proceedings of the International Congress of Mathematicians 2010, ICM 2010

Type

Conference paper

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

DSpace software copyright © 2002-2026 LYRASIS