Counting connected graphs inside-out (Q1767667)

From MaRDI portal
Revision as of 19:37, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting connected graphs inside-out
scientific article

    Statements

    title
    Counting connected graphs inside-out (English)
    0 references
    author
    Nicholas C. Wormald
    0 references
    Boris G. Pittel
    0 references
    publication date
    8 March 2005
    0 references
    Mathematics Subject Classification ID
    05C30
    0 references
    05C80
    0 references
    05A16
    0 references
    zbMATH DE Number
    2142246
    0 references
    zbMATH Keywords
    Enumeration
    0 references
    Core
    0 references
    Connected
    0 references
    Asymptotics
    0 references
    Limit distributions
    0 references
    Giant component
    0 references
    Random graph
    0 references
    OpenAlex ID
    W2036312115
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1767667&oldid=34384043"
    Powered by MediaWiki