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

zbMath1409.90212arXiv1706.10193MaRDI QIDQ668054

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

Publication date: 5 March 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.10193

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal combinatorics (05D99)

Related Items (4)

The length of an s-increasing sequence of r-tuples ⋮ Extremal problems for pairs of triangles ⋮ Saturation problems in convex geometric hypergraphs ⋮ Extremal problems for convex geometric hypergraphs and ordered hypergraphs

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the graph removal lemma
• Packing tripods
• Packing tripods: narrowing the density gap
• Combinatorial packings of<tex>R^3</tex>by certain error spheres
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• The length of an s-increasing sequence of r-tuples
• Triangles of extremal area or perimeter in a finite planar point set

This page was built for publication: More Turán-type theorems for triangles in convex point sets