A note on maximum size of a graph without isolated vertices under the given matching number (Q6095058)
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: A note on maximum size of a graph without isolated vertices under the given matching number |
scientific article; zbMATH DE number 7748307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on maximum size of a graph without isolated vertices under the given matching number |
scientific article; zbMATH DE number 7748307 |
Statements
A note on maximum size of a graph without isolated vertices under the given matching number (English)
0 references
11 October 2023
0 references
maximum number of edges
0 references
Turán problem
0 references
matching
0 references
fractional matching
0 references
0.8225549459457397
0 references
0.7859103083610535
0 references
0.7850829362869263
0 references
0.7833779454231262
0 references
0.7802934646606445
0 references
