---
res:
  bibo_abstract:
  - 'A thrackle is a graph drawn in the plane so that every pair of its edges meet
    exactly once: either at a common end vertex or in a proper crossing. We prove
    that any thrackle of n vertices has at most 1.3984n edges. Quasi-thrackles are
    defined similarly, except that every pair of edges that do not share a vertex
    are allowed to cross an odd number of times. It is also shown that the maximum
    number of edges of a quasi-thrackle on n vertices is 3/2(n-1), and that this bound
    is best possible for infinitely many values of n.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Radoslav
      foaf_name: Fulek, Radoslav
      foaf_surname: Fulek
      foaf_workInfoHomepage: http://www.librecat.org/personId=39F3FFE4-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-8485-1774
  - foaf_Person:
      foaf_givenName: János
      foaf_name: Pach, János
      foaf_surname: Pach
  bibo_doi: 10.1007/978-3-319-73915-1_14
  bibo_volume: 10692
  dct_date: 2018^xs_gYear
  dct_language: eng
  dct_publisher: Springer@
  dct_title: 'Thrackles: An improved upper bound@'
...