{"type":"journal_article","language":[{"iso":"eng"}],"publist_id":"2015","citation":{"apa":"Edelsbrunner, H., &#38; Welzl, E. (1986). On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. Elsevier. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>","chicago":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>. Elsevier, 1986. <a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">https://doi.org/10.1016/0097-3165(86)90078-6</a>.","ieee":"H. Edelsbrunner and E. Welzl, “On the maximal number of edges of many faces in an arrangement,” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2. Elsevier, pp. 159–166, 1986.","ista":"Edelsbrunner H, Welzl E. 1986. On the maximal number of edges of many faces in an arrangement. Journal of Combinatorial Theory Series A. 41(2), 159–166.","ama":"Edelsbrunner H, Welzl E. On the maximal number of edges of many faces in an arrangement. <i>Journal of Combinatorial Theory Series A</i>. 1986;41(2):159-166. doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>","mla":"Edelsbrunner, Herbert, and Emo Welzl. “On the Maximal Number of Edges of Many Faces in an Arrangement.” <i>Journal of Combinatorial Theory Series A</i>, vol. 41, no. 2, Elsevier, 1986, pp. 159–66, doi:<a href=\"https://doi.org/10.1016/0097-3165(86)90078-6\">10.1016/0097-3165(86)90078-6</a>.","short":"H. Edelsbrunner, E. Welzl, Journal of Combinatorial Theory Series A 41 (1986) 159–166."},"abstract":[{"text":"Let A be an arrangement of n lines in the plane. Suppose F1,…, Fk are faces in the dissection induced by A and that Fi is a t(Fi)-gon. We give asymptotic bounds on the maximal sum ∑i=1kt(Fi) which can be realized by k different faces in an arrangement of n lines. The results improve known bounds for k of higher order than n(1/2).","lang":"eng"}],"date_published":"1986-11-01T00:00:00Z","oa_version":"Published Version","year":"1986","volume":41,"status":"public","day":"01","publication":"Journal of Combinatorial Theory Series A","date_updated":"2022-02-01T09:46:55Z","publisher":"Elsevier","scopus_import":"1","_id":"4103","publication_identifier":{"eissn":["1096-0899"],"issn":["0097-3165"]},"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"full_name":"Welzl, Emo","last_name":"Welzl","first_name":"Emo"}],"extern":"1","intvolume":"        41","acknowledgement":"The second author thanks Gan Gusfield for useful discussion.","quality_controlled":"1","article_processing_charge":"No","page":"159 - 166","doi":"10.1016/0097-3165(86)90078-6","main_file_link":[{"url":"https://www.sciencedirect.com/science/article/pii/0097316586900786?via%3Dihub","open_access":"1"}],"publication_status":"published","month":"11","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","title":"On the maximal number of edges of many faces in an arrangement","oa":1,"issue":"2","date_created":"2018-12-11T12:06:57Z"}