On the number of edges in geometric graphs without empty triangles

DOI10.1007/s00373-012-1220-9zbMath1290.05064OpenAlexW2030783356MaRDI QIDQ2637713

C. Bautista-Santiago, Jorge Urrutia, Clemens Huemer, Carlos Seara, A. Ramírez-Vigueras, Marco A. Heredia

Publication date: 14 February 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1220-9

zbMATH Keywords

combinatorial geometrygeometric graphsextremal problemempty trianglesHorton set

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (2)

Carathéodory's theorem in depth ⋮ Counting the number of isosceles triangles in rectangular regular grids

Cites Work

• Unnamed Item
• Unnamed Item
• Konvexe Fünfecke in ebenen Punktmengen
• The empty hexagon theorem
• Empty convex hexagons in planar point sets
• Sets with No Empty Convex 7-Gons
• Planar point sets with a small number of empty convex polygons
• Discrete and Computational Geometry

This page was built for publication: On the number of edges in geometric graphs without empty triangles