Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On the number of edges in geometric graphs without empty triangles

Autor
Bautista, C.; Heredia, M.; Huemer, C.; Ramírez, A.; Seara, C.; URRUTIA, J.
Tipus d'activitat
Article en revista
Revista
Graphs and combinatorics
Data de publicació
2013-11-01
Volum
29
Número
6
Pàgina inicial
1623
Pàgina final
1631
DOI
https://doi.org/10.1007/s00373-012-1220-9 Obrir en finestra nova
URL
http://link.springer.com/article/10.1007%2Fs00373-012-1220-9 Obrir en finestra nova
Resum
In this paper we study the extremal type problem arising from the question: What is the maximum number ET(S) of edges that a geometric graph G on a planar point set S can have such that it does not contain empty triangles? We prove:(Formula Presented). © 2012 Springer.
Paraules clau
Combinatorial geometry, Empty triangles, Extremal problem, Geometric graphs
Grup de recerca
CGA -Computational Geometry and Applications
DCG - Discrete and Combinatorial Geometry

Participants

  • Bautista Santiago, Crevel  (autor)
  • Heredia, Marco A.  (autor)
  • Huemer, Clemens  (autor)
  • Ramírez Vigueras, Adriana  (autor)
  • Seara Ojea, Carlos  (autor)
  • Urrutia Galicia, Jorge  (autor)