Tight lower bounds on the matching number in a graph with given maximum degree (Q4553732): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2963232981 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1604.05020 / rank | |||
Normal rank | |||
Latest revision as of 19:15, 19 April 2024
scientific article; zbMATH DE number 6969499
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
