Mostra el registre d'ítem simple
Empty triangles in good drawings of the complete graph
dc.contributor.author | Aichholzer, Oswin |
dc.contributor.author | Hackl, Thomas |
dc.contributor.author | Pilz, Alexander |
dc.contributor.author | Ramos Alonso, Pedro Antonio |
dc.contributor.author | Sacristán Adinolfi, Vera |
dc.contributor.author | Vogtenhuber, Birgit |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada II |
dc.date.accessioned | 2015-10-22T12:57:35Z |
dc.date.available | 2016-03-01T01:30:35Z |
dc.date.issued | 2015 |
dc.identifier.citation | Aichholzer, O., Hackl, T., Pilz, A., Ramos, P., Sacristán, V., Vogtenhuber, B. Empty triangles in good drawings of the complete graph. "Graphs and combinatorics", 2015, vol. 31, núm. 2, p. 335-345. |
dc.identifier.issn | 0911-0119 |
dc.identifier.uri | http://hdl.handle.net/2117/78142 |
dc.description.abstract | A good drawing of a simple graph is a drawing on the sphere or, equivalently, in the plane in which vertices are drawn as distinct points, edges are drawn as Jordan arcs connecting their end vertices, and any pair of edges intersects at most once. In any good drawing, the edges of three pairwise connected vertices form a Jordan curve which we call a triangle. We say that a triangle is empty if one of the two connected components it induces does not contain any of the remaining vertices of the drawing of the graph. We show that the number of empty triangles in any good drawing of the complete graph Kn with n vertices is at least n. |
dc.format.extent | 11 p. |
dc.language.iso | eng |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Combinatòria |
dc.subject.lcsh | Combinatorial analysis |
dc.subject.other | Good drawings Empty triangles Erdos-Szekeres type problems |
dc.title | Empty triangles in good drawings of the complete graph |
dc.type | Article |
dc.subject.lemac | Combinatòria |
dc.contributor.group | Universitat Politècnica de Catalunya. DCCG - Grup de recerca en geometria computacional, combinatoria i discreta |
dc.identifier.doi | 10.1007/s00373-015-1550-5 |
dc.description.peerreviewed | Peer Reviewed |
dc.subject.ams | Classificació AMS::05 Combinatorics::05B Designs and configurations |
dc.relation.publisherversion | http://link.springer.com/article/10.1007%2Fs00373-015-1550-5 |
dc.rights.access | Open Access |
local.identifier.drac | 15608789 |
dc.description.version | Postprint (author’s final draft) |
local.citation.author | Aichholzer, O.; Hackl, T.; Pilz, A.; Ramos, P.; Sacristán, V.; Vogtenhuber, B. |
local.citation.publicationName | Graphs and combinatorics |
local.citation.volume | 31 |
local.citation.number | 2 |
local.citation.startingPage | 335 |
local.citation.endingPage | 345 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [85]
-
Articles de revista [3.268]