[{"publication_identifier":{"issn":[]},"month":"04","language":[{}],"project":[{"call_identifier":"FWF","name":"Eliminating intersections in drawings of graphs","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","isi":1,"external_id":{"arxiv":[],"isi":[]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1708.08037"}],"oa":1,"creator":{"login":"apreinsp","id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},"volume":259,"date_created":"2019-01-20T22:59:17Z","dini_type":"doc-type:article","date_updated":"2023-08-24T14:39:33Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"433"}]},"author":[{"orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","first_name":"Radoslav"},{"last_name":"Pach","first_name":"János"}],"department":[{"tree":[{"_id":"ResearchGroups"},{"_id":"IST"}],"_id":"UlWa"}],"publication_status":"published","uri_base":"https://research-explorer.ista.ac.at","article_processing_charge":"No","day":"30","scopus_import":"1","dc":{"description":["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 [Formula presented](n−1), and that this bound is best possible for infinitely many values of n."],"identifier":["https://research-explorer.ista.ac.at/record/5857"],"type":["info:eu-repo/semantics/article","doc-type:article","text","http://purl.org/coar/resource_type/c_6501"],"creator":["Fulek, Radoslav","Pach, János"],"title":["Thrackles: An improved upper bound"],"publisher":["Elsevier"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2018.12.025","info:eu-repo/semantics/altIdentifier/issn/0166218X","info:eu-repo/semantics/altIdentifier/wos/000466061100020","info:eu-repo/semantics/altIdentifier/arxiv/1708.08037","info:eu-repo/grantAgreement/FWF//M02281"],"source":["Fulek R, Pach J. Thrackles: An improved upper bound. Discrete Applied Mathematics. 2019;259(4):266-231. doi:10.1016/j.dam.2018.12.025"],"rights":["info:eu-repo/semantics/openAccess"],"language":["eng"],"date":["2019"]},"date_published":"2019-04-30T00:00:00Z","page":"266-231","article_type":"original","citation":{"chicago":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics. Elsevier, 2019. https://doi.org/10.1016/j.dam.2018.12.025.","mla":"Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.","short":"R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.","ista":"Fulek R, Pach J. 2019. Thrackles: An improved upper bound. Discrete Applied Mathematics. 259(4), 266–231.","ieee":"R. Fulek and J. Pach, “Thrackles: An improved upper bound,” Discrete Applied Mathematics, vol. 259, no. 4. Elsevier, pp. 266–231, 2019.","apa":"Fulek, R., & Pach, J. (2019). Thrackles: An improved upper bound. Discrete Applied Mathematics. Elsevier. https://doi.org/10.1016/j.dam.2018.12.025"},"publication":"Discrete Applied Mathematics","issue":"4","abstract":[{"lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 259","status":"public","_id":"5857","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8"}]