On the number of perfect matchings in a bipartite graph (Q2848545)
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 6212016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of perfect matchings in a bipartite graph |
scientific article; zbMATH DE number 6212016 |
Statements
26 September 2013
0 references
perfect matchings
0 references
matching covered graphs
0 references
On the number of perfect matchings in a bipartite graph (English)
0 references
0.8282744288444519
0 references
0.827104926109314
0 references
0.8116729259490967
0 references
