Edge-Disjoint Cliques in Graphs with High Minimum Degree (Q3192169)
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: Edge-Disjoint Cliques in Graphs with High Minimum Degree |
scientific article; zbMATH DE number 6348198
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edge-Disjoint Cliques in Graphs with High Minimum Degree |
scientific article; zbMATH DE number 6348198 |
Statements
Edge-Disjoint Cliques in Graphs with High Minimum Degree (English)
0 references
26 September 2014
0 references
triangles
0 references
packing
0 references
fractional
0 references
0.9180115
0 references
0.9131135
0 references
0.9131135
0 references
0.8969398
0 references
0.8969398
0 references
0.8947793
0 references
0.8929417
0 references
0 references
