@inproceedings{466f5f71d00e4886b000e8622ed1f306,

title = "On the number of edges of fan-crossing free graphs",

abstract = "A graph drawn in the plane with n vertices is fan-crossing free if there is no triple of edges e,f and g, such that e and f have a common endpoint and g crosses both e and f. We prove a tight bound of 4n - 9 on the maximum number of edges of such a graph for a straight-edge drawing. The bound is 4n - 8 if the edges are Jordan curves. We also discuss generalizations to monotone graph properties.",

keywords = "extremal graph, graph drawing, graph theory, planar graph",

author = "Otfried Cheong and Sariel Har-Peled and Heuna Kim and Kim, {Hyo Sil}",

note = "Funding Information: This research was supported in part by NRF grant 2011-0016434 and in part by NRF grant 2011-0030044 (SRC-GAIA), both funded by the government of Korea.; 24th International Symposium on Algorithms and Computation, ISAAC 2013 ; Conference date: 16-12-2013 Through 18-12-2013",

year = "2013",

doi = "10.1007/978-3-642-45030-3_16",

language = "English (US)",

isbn = "9783642450297",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "163--173",

booktitle = "Algorithms and Computation - 24th International Symposium, ISAAC 2013, Proceedings",

}