Matching behaviour is asymptotically normal

DOI10.1007/BF02579458zbMath0504.05047OpenAlexW2042407977MaRDI QIDQ1835685

Chris D. Godsil

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579458

zbMATH Keywords

asymptotic normalitymatchings polynomialsrandomly chosen matching

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Central limit theorems, Lee-Yang zeros, and graph-counting polynomials ⋮ Analytic properties of sextet polynomials of hexagonal systems ⋮ Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones ⋮ Disordered monomer-dimer model on cylinder graphs ⋮ Several improved asymptotic normality criteria and their applications to graph polynomials ⋮ The partition polynomial of a finite set system ⋮ MAX-plus objects to study the complexity of graphs ⋮ Asymptotic normality of a class of discrete power series distributions ⋮ Asymptotic normality of Laplacian coefficients of graphs ⋮ Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones ⋮ Asymptotic normality of associated Lah numbers ⋮ Developments in the theory of graph spectra ⋮ Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees ⋮ Tree and forest weights and their application to nonuniform random graphs ⋮ The asymptotic normality of adjacency coefficients of bipartite graphs and skew-adjacency coefficients of oriented graphs ⋮ Random decompositions of Eulerian statistics ⋮ The behaviour of (n over \(k,\dots ,k,n-ik)c^ i/i!\) is asymptotically normal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Application of the Berry-Esseen inequality to combinatorial estimates
• Hermite polynomials and a duality relation for matchings polynomials
• Theory of monomer-dimer systems
• Central and local limit theorems applied to asymptotic enumeration
• On the theory of the matching polynomial
• Matchings and walks in graphs
• Stirling Behavior is Asymptotically Normal
• On Solutions of x^d = 1 In Symmetric Groups