Matching behaviour is asymptotically normal

DOI10.1007/BF02579458MaRDI QIDQ1835685zbMATH OpenOpenAlexFDO

Authors Chris 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)

Cites work

• scientific article; zbMATH DE number 3127542 (Why is no real title available?)
• scientific article; zbMATH DE number 3223982 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Application of the Berry-Esseen inequality to combinatorial estimates
• Central and local limit theorems applied to asymptotic enumeration
• Hermite polynomials and a duality relation for matchings polynomials
• Matchings and walks in graphs
• On Solutions of x^d = 1 In Symmetric Groups
• On the theory of the matching polynomial
• Stirling Behavior is Asymptotically Normal
• Theory of monomer-dimer systems

Cited in

(17)

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

This page was built for publication: Matching behaviour is asymptotically normal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1835685)