A probabilistic proof of an asymptotic formula for the number of labelled regular graphs (Q1150630): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q97309549 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4114551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Enumeration of Locally Restricted Graphs (I) / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0195-6698(80)80030-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091476183 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:58, 30 July 2024

scientific article
Language Label Description Also known as
English
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
scientific article

    Statements

    A probabilistic proof of an asymptotic formula for the number of labelled regular graphs (English)
    0 references
    0 references
    1980
    0 references
    labelled regular graphs
    0 references
    asymptotic formulae
    0 references

    Identifiers