Subgraphs of random graphs with specified degrees
Description
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
| Collections | ANU Research Publications |
|---|---|
| Date published: | 2010 |
| Type: | Conference paper |
| URI: | http://hdl.handle.net/1885/83999 |
| Source: | Proceedings of the International Congress of Mathematicians 2010, ICM 2010 |
Download
There are no files associated with this item.
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator
+61 2 6125 5111
The Australian National University, Canberra
CRICOS Provider : 00120C
ABN : 52 234 063 906
