An asymptotic independence theorem for the number of matchings in graphs (Q1043805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4402005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of matchings in random regular graphs and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of a theorem of Siegel / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of the matching polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of monomer-dimer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic systems with minimal Hosoya index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumeration problems for classes of self-similar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4253909 / rank
 
Normal rank

Latest revision as of 07:19, 2 July 2024

scientific article
Language Label Description Also known as
English
An asymptotic independence theorem for the number of matchings in graphs
scientific article

    Statements

    An asymptotic independence theorem for the number of matchings in graphs (English)
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    matchings
    0 references
    independence
    0 references
    set distance
    0 references
    asymptotic enumeration
    0 references

    Identifiers