@inproceedings{b026c66c0890427da5e2aba5e952a03f,

title = "Subgraphs of random graphs with specified degrees",

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 this paper we provide a partial survey of the field, with emphasis on two general techniques: the method of switchings and the multidimensional saddle-point method.",

keywords = "Random graphs, Regular graph, Subgraph, Vertex degree",

author = "McKay, {Brendan D.}",

year = "2010",

language = "English",

isbn = "9814324302",

series = "Proceedings of the International Congress of Mathematicians 2010, ICM 2010",

pages = "2489--2501",

booktitle = "Proceedings of the International Congress of Mathematicians 2010, ICM 2010",

note = "International Congress of Mathematicians 2010, ICM 2010 ; Conference date: 19-08-2010 Through 27-08-2010",

}