Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs

DOI10.1137/S0895480101395695MaRDI QIDQ4785705zbMATH OpenOpenAlexFDO

Authors Nicholas Pippenger

Publication date 5 January 2003

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895480101395695

zbMATH Keywords

generating functionsasymptotic enumeration

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16)

Recommendations

• scientific article; zbMATH DE number 4051676
• The enumeration of perfect matchings in two types of graphs
• On the number of perfect matchings for some certain types of bipartite graphs
• On the number of perfect matchings in a bipartite graph
• Matchings in complete bipartite graphs and the r-Lah numbers
• The number of matchings in random regular graphs and bipartite graphs
• Counting the number of matchings in chordal and chordal bipartite graph classes
• Enumeration of perfect matchings of a type of Cartesian products of graphs
• Enumerating perfect matchings in inductively-defined families of graphs
• Enumeration of bipartite self-complementary graphs

Cited in

(3)

• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• Incidence matrices for matchings
• The total number of matchings of \(L_{n,p}^*\)

This page was built for publication: Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs

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