An improved upper bound and algorithm for clique covers (Q1748206)
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: An improved upper bound and algorithm for clique covers |
scientific article; zbMATH DE number 6867174
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved upper bound and algorithm for clique covers |
scientific article; zbMATH DE number 6867174 |
Statements
An improved upper bound and algorithm for clique covers (English)
0 references
9 May 2018
0 references
clique covers
0 references
indeterminates
0 references
Lovász bound
0 references
Mantel's theorem
0 references
0.8176076412200928
0 references
0.7605315446853638
0 references
0.7512122988700867
0 references
0.7297101616859436
0 references
