Subgraphs of random graphs with specified degrees
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|
|Source:||Proceedings of the International Congress of Mathematicians 2010, ICM 2010|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.