Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (Q512562)
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 6689469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded |
scientific article; zbMATH DE number 6689469 |
Statements
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded (English)
0 references
27 February 2017
0 references
edge-extremal graphs
0 references
claw-free graphs
0 references
maximum matching
0 references
Ramsey theory
0 references
0.7855413556098938
0 references
0.7835978269577026
0 references
0.7627958655357361
0 references
0.7575243711471558
0 references
0.754721999168396
0 references
