A new lower bound based on Gromov's method of selecting heavily covered points (Q452003)

From MaRDI portal
Revision as of 15:44, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/dcg/KralMS12, #quickstatements; #temporary_batch_1731508824982)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
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
    0 references
    0 references
    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

    Identifiers