{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:44:10Z","timestamp":1753893850698,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>\u00a0We 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.\u00a0 As forbidden configurations we consider all 8 ways in which a pair of triangles in such a point set can interact.\u00a0 This leads to 256 extremal Tur\u00e1n-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.<\/jats:p>","DOI":"10.37236\/7224","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:16:15Z","timestamp":1578640575000},"source":"Crossref","is-referenced-by-count":2,"title":["More Tur\u00e1n-Type Theorems for Triangles in Convex Point Sets"],"prefix":"10.37236","volume":"26","author":[{"given":"Boris","family":"Aronov","sequence":"first","affiliation":[]},{"given":"Vida","family":"Dujmovi\u0107","sequence":"additional","affiliation":[]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[]},{"given":"Aur\u00e9lien","family":"Ooms","sequence":"additional","affiliation":[]},{"given":"Lu\u0131\u0301s Fernando Schultz","family":"Xavier da Silveira","sequence":"additional","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2019,1,25]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p8\/7768","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i1p8\/7768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:18:51Z","timestamp":1579234731000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i1p8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,25]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,1,11]]}},"URL":"https:\/\/doi.org\/10.37236\/7224","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2019,1,25]]},"article-number":"P1.8"}}