New lower bounds for matching numbers of general and bipartite graphs (Q5405504)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New lower bounds for matching numbers of general and bipartite graphs |
scientific article; zbMATH DE number 6277732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New lower bounds for matching numbers of general and bipartite graphs |
scientific article; zbMATH DE number 6277732 |
Statements
2 April 2014
0 references
matching
0 references
bipartite graph
0 references
minimum degree
0 references
0.8628640174865723
0 references
0.8564615249633789
0 references
0.825813889503479
0 references
0.8249808549880981
0 references
0.819520115852356
0 references
