Abstract
Let K be a convex set in 2 such that every line in 2 meets . We prove that for , and that this bound is best possible, thus solving a problem of Kannan and Lovász.
| Original language | English |
|---|---|
| Pages (from-to) | 121-128 |
| Journal | Linear Algebra and Its Applications |
| Volume | 134 |
| DOIs | |
| Publication status | Published - 1990 |
Fingerprint
Dive into the research topics of 'Blowing up convex sets in the plane'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver