Electronic Resource
Springer
Discrete & computational geometry
18 (1997), S. 369-376
ISSN:
1432-0444
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract. A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly one point interior to both arcs. About 40 years ago, J. H. Conway conjectured that the number of edges of a thrackle cannot exceed the number of its vertices. We show that a thrackle has at most twice as many edges as vertices. Some related problems and generalizations are also considered.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/PL00009322
Permalink
| Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |
