A new proof of an integral formula for counting perfect matchings in graphs (Q2979212)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6710685
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new proof of an integral formula for counting perfect matchings in graphs |
scientific article; zbMATH DE number 6710685 |
Statements
3 May 2017
0 references
perfect matchings
0 references
rook polynomial
0 references
bipartite complement
0 references
inclusion-exclusion
0 references
matching polynomials
0 references
Z-counting polynomials
0 references
permutations with restricted position
0 references
restricted placement in finite vector spaces
0 references
Kaplansky-Riordan theory
0 references
Möbius inversion
0 references
0.8022515773773193
0 references
0.7628716826438904
0 references
0.759203314781189
0 references
0.7548249363899231
0 references
0.7511471509933472
0 references
