Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732)
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 6969499
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight lower bounds on the matching number in a graph with given maximum degree |
scientific article; zbMATH DE number 6969499 |
Statements
Tight lower bounds on the matching number in a graph with given maximum degree (English)
0 references
31 October 2018
0 references
convex set
0 references
matching number
0 references
maximum degree
0 references
0.9563215
0 references
0.95077837
0 references
0.93233037
0 references
0.9228916
0 references
0.92122114
0 references
0 references
0.91629106
0 references
0.9161742
0 references
