Blowing up convex sets in the plane

    Research output: Contribution to journalArticleAcademicpeer-review

    15 Citations (Scopus)
    1 Downloads (Pure)

    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 languageEnglish
    Pages (from-to)121-128
    JournalLinear Algebra and Its Applications
    Volume134
    DOIs
    Publication statusPublished - 1990

    Fingerprint Dive into the research topics of 'Blowing up convex sets in the plane'. Together they form a unique fingerprint.

    Cite this