| dc.contributor.author | Ackerman, Eyal | |
| dc.contributor.author | Fox, Jacob | |
| dc.contributor.author | Pinchasi, Rom | |
| dc.date.accessioned | 2015-10-26T12:08:48Z | |
| dc.date.available | 2015-10-26T12:08:48Z | |
| dc.date.issued | 2013-03 | |
| dc.date.submitted | 2013-02 | |
| dc.identifier.issn | 0012365X | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/99447 | |
| dc.description.abstract | Let G be a geometric graph on n vertices in general position in the plane. We say that G is k-light if no edge e of G has the property that each of the two open half-planes bounded by the line through e contains more than k edges of G. We extend the previous result in Ackerman and Pinchasi (2012) [1] and with a shorter argument show that every k-light geometric graph on n vertices has at most O(n√k) edges. This bound is best possible. | en_US |
| dc.description.sponsorship | Simons Foundation (Fellowship) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (Grant DMS-1069197) | en_US |
| dc.description.sponsorship | NEC Corporation (MIT Award) | en_US |
| dc.language.iso | en_US | |
| dc.publisher | Elsevier | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1016/j.disc.2013.03.001 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-NoDerivatives | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | en_US |
| dc.source | MIT Web Domain | en_US |
| dc.title | A note on light geometric graphs | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Ackerman, Eyal, Jacob Fox, and Rom Pinchasi. “A Note on Light Geometric Graphs.” Discrete Mathematics 313, no. 12 (June 2013): 1281–1283. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
| dc.contributor.mitauthor | Fox, Jacob | en_US |
| dc.relation.journal | Discrete Mathematics | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dspace.orderedauthors | Ackerman, Eyal; Fox, Jacob; Pinchasi, Rom | en_US |
| mit.license | PUBLISHER_CC | en_US |
| mit.metadata.status | Complete | |
