Subgraphs of random graphs with specified degrees

Brendan D. McKay*

*Corresponding author for this work

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    16 Citations (Scopus)

    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.

    Original languageEnglish
    Title of host publicationProceedings of the International Congress of Mathematicians 2010, ICM 2010
    Pages2489-2501
    Number of pages13
    Publication statusPublished - 2010
    EventInternational Congress of Mathematicians 2010, ICM 2010 - Hyderabad, India
    Duration: 19 Aug 201027 Aug 2010

    Publication series

    NameProceedings of the International Congress of Mathematicians 2010, ICM 2010

    Conference

    ConferenceInternational Congress of Mathematicians 2010, ICM 2010
    Country/TerritoryIndia
    CityHyderabad
    Period19/08/1027/08/10

    Fingerprint

    Dive into the research topics of 'Subgraphs of random graphs with specified degrees'. Together they form a unique fingerprint.

    Cite this