A new lower bound based on Gromov's method of selecting heavily covered points (Q452003)
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 new lower bound based on Gromov's method of selecting heavily covered points |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new lower bound based on Gromov's method of selecting heavily covered points |
scientific article |
Statements
A new lower bound based on Gromov's method of selecting heavily covered points (English)
0 references
19 September 2012
0 references
Covering points by simplices
0 references
Flag algebras
0 references
Cofilling profiles
0 references
Boros-Füredi-Bárány-Pach-Gromov theorem
0 references
0 references
0.9291343688964844
0 references
0.7903512716293335
0 references
0.7503819465637207
0 references
0.7493911385536194
0 references
