More turán-type theorems for triangles in convex point sets

Boris Aronov, Vida Dujmović, Pat Morin, Aurélien Ooms, Luís Fernando, Schultz Xavier da Silveira

    Research output: Contribution to journalArticlepeer-review

    Abstract

    We study the following family of problems: Given a set of n points in convex position, what is the maximum number triangles one can create having these points as vertices while avoiding certain sets of forbidden configurations. As forbidden configurations we consider all 8 ways in which a pair of triangles in such a point set can interact. This leads to 256 extremal Turán-type questions. We give nearly tight (within a log n factor) bounds for 248 of these questions and show that the remaining 8 questions are all asymptotically equivalent to Stein’s longstanding tripod packing problem.

    Original languageEnglish (US)
    Article number#P1.8
    JournalElectronic Journal of Combinatorics
    Volume26
    Issue number1
    DOIs
    StatePublished - 2019

    ASJC Scopus subject areas

    • Theoretical Computer Science
    • Geometry and Topology
    • Discrete Mathematics and Combinatorics
    • Computational Theory and Mathematics
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'More turán-type theorems for triangles in convex point sets'. Together they form a unique fingerprint.

    Cite this